Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Goldberg, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On implementing the push-relabel method for the maximum flow problem
B.V. Cherkassky
,
A.V. Goldberg
Algorithmica
19
, 1997, pp. 390-410
Improved approximation algorithms for network design problems
M.X. Goemans
,
A.V. Goldberg
,
S. Plotkin
,
D.B. Shmoys
,
é. Tardos
,
D.P. Williamson
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 223-232
Network decomposition and locality in distributed computation
B. Awerbuch
,
M. Luby
,
A. Goldberg
,
S. Plotkin
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 364-369
Interior-point methods in parallel computation
A. Goldberg
,
S. Plotkin
,
D. Shmoys
,
E. Tardos
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 350-355
Interior-point methods in parallel computation
A.V. Goldberg
,
S.A. Plotkin
,
D.B. Shmoys
,
é. Tardos
Technical Report (STAN-CS-89-1259), 1989, May
Finding minimum-cost circulations by canceling negative cycles
A.V. Goldberg
,
R.E. Tarjan
Journal of the ACM
36
(4), 1989, October, pp. 873-886
Lower bounds for pseudorandom number generators
M. Kharitonov
,
A. Goldberg
,
M. Yung
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 242-247
Combinatorial algorithms for the generalized circulation problem
A.V. Goldberg
,
S.A. Plotkin
,
é. Tardos
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 432-443
Sublinear-time parallel algorithms for matching and related problems
A.V. Goldberg
,
S.A. Plotkin
,
P.M. Vaidya
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 174-185
Transparent process cloning: A tool for load management of distributed programs
A.P. Goldberg
,
D.R. Jefferson
Proceedings of the 1987 International Conference on Parallel Processing, ICPP'87 (Penn State University, August 17-21, 1987)
, 1987, pp. 728-734
Parallel symmetry-breaking in sparse graphs
A. Goldberg
,
S. Plotkin
,
G. Shannon
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 315-324
Parallel
(\Delta+1)
-coloring of constant-degree graphs
A.V. Goldberg
,
S.A. Plotkin
Information Processing Letters
25
(4), 1987, June, pp. 241-245
Solving minimum-cost flow problems by successive approximations
A. Goldberg
,
R. Tarjan
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 7-18
A new approach to the maximum flow problem
A.V. Goldberg
,
R.E. Tarjan
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 136-146
Compression and ranking
A. Goldberg
,
M. Sipser
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 440-448
On finding the exact solution of a zero-one knapsack problem
A. Goldberg
,
A. Marchetti-Spaccamela
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC'84 (Washington, DC, April 30 - May 2, 1984)
, 1984, pp. 359-368
Average time analyses of simplified Davis-Putnam procedures
A. Goldberg
,
P. Purdom
,
C. Brown
Information Processing Letters
15
(2), 1982, September, pp. 72-75
Finding a maximum density subgraph
A.V. Goldberg
misc