The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew V. Goldberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrew V. Goldberg, Robert Endre Tarjan
    A new approach to the maximum-flow problem. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:921-940 [Journal]
  2. Andrew V. Goldberg, Peter N. Yianilos
    Towards an Archival Intermemory. [Citation Graph (0, 0)][DBLP]
    ADL, 1998, pp:147-156 [Conf]
  3. Andrew V. Goldberg, Renato Fonseca F. Werneck
    Computing Point-to-Point Shortest Paths from External Memory. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:26-40 [Conf]
  4. Yuan Chen, Jan Edler, Andrew V. Goldberg, Allan Gottlieb, Sumeet Sobti, Peter N. Yianilos
    A Prototype Implementation of Archival Intermemory. [Citation Graph (0, 0)][DBLP]
    ACM DL, 1999, pp:28-37 [Conf]
  5. Boris V. Cherkassky, Andrew V. Goldberg
    Negative-Cycle Detection Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:349-363 [Conf]
  6. Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin
    Truthful and Competitive Double Auctions. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:361-373 [Conf]
  7. Andrew V. Goldberg
    A Simple Shortest Path Algorithm with Linear Average Time. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:230-241 [Conf]
  8. Andrew V. Goldberg
    Optimization Algorithms For Large Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:1-9 [Conf]
  9. Andrew V. Goldberg, Jason D. Hartline
    Competitive Auctions for Multiple Digital Goods. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:416-427 [Conf]
  10. Andrew V. Goldberg, Alexander V. Karzanov
    Maximum Skew-Symmetric Flows. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:155-170 [Conf]
  11. Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin
    Network Decomposition and Locality in Distributed Computation [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:364-369 [Conf]
  12. Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
    Interior-Point Methods in Parallel Computation [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:350-355 [Conf]
  13. Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos
    Combinatorial Algorithms for the Generalized Circulation Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:432-443 [Conf]
  14. Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
    Sublinear-Time Parallel Algorithms for Matching and Related Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:174-185 [Conf]
  15. Andrew V. Goldberg, Satish Rao
    Beyond the Flow Decomposition Barrier. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:2-11 [Conf]
  16. Andrew V. Goldberg, Satish Rao
    Flows in Undirected Unit Capacity Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:32-34 [Conf]
  17. Michael Kharitonov, Andrew V. Goldberg, Moti Yung
    Lower Bounds for Pseudorandom Number Generators [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:242-247 [Conf]
  18. Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi
    Routing in Networks with Low Doubling Dimension. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2006, pp:75- [Conf]
  19. Boris V. Cherkassky, Andrew V. Goldberg
    On Implementing Push-Relabel Method for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:157-171 [Conf]
  20. Andrew V. Goldberg
    An efficient implementation of a scaling minimum-cost flow algorithm. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:251-266 [Conf]
  21. Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein
    An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:338-352 [Conf]
  22. Andrew V. Goldberg
    Shortest Path Algorithms: Engineering Aspects. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:502-513 [Conf]
  23. Andrew V. Goldberg, Karl J. Lieberherr
    Efficient Test Generation Algorithms. [Citation Graph (0, 0)][DBLP]
    ITC, 1985, pp:508-517 [Conf]
  24. Andrew V. Goldberg, Jason D. Hartline
    Envy-free auctions for digital goods. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:29-35 [Conf]
  25. Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein
    Experimental Study of Minimum Cut Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:324-333 [Conf]
  26. Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
    Shortest Paths Algorithms: Theory and Experimental Evaluation. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:516-525 [Conf]
  27. Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
    Buckets, Heaps, Lists, and Monotone Priority Queues. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:83-92 [Conf]
  28. Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson
    Improved Approximation Algorithms for Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:223-232 [Conf]
  29. Andrew V. Goldberg
    Scaling Algorithms for the Shortest Paths Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:222-231 [Conf]
  30. Paul W. Goldberg, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk, Andrew V. Goldberg, Kostas Tsioutsiouliklis
    Cut Tree Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:376-385 [Conf]
  31. Andrew V. Goldberg, Jason D. Hartline
    Competitiveness via consensus. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:215-222 [Conf]
  32. Andrew V. Goldberg, Chris Harrelson
    Computing the shortest path: A search meets graph theory. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:156-165 [Conf]
  33. Andrew V. Goldberg, Jason D. Hartline
    Collusion-resistant mechanisms for single-parameter agents. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:620-629 [Conf]
  34. Andrew V. Goldberg, Jason D. Hartline, Andrew Wright
    Competitive auctions and digital goods. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:735-744 [Conf]
  35. Andrew V. Goldberg, Alexander V. Karzanov
    Path Problems in Skew-Symmetric Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:526-535 [Conf]
  36. Andrew V. Goldberg, Bernard M. E. Moret
    Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:913-914 [Conf]
  37. Tomasz Radzik, Andrew V. Goldberg
    Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:110-119 [Conf]
  38. Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks
    A Lower Bound on the Competitive Ratio of Truthful Auctions. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:644-655 [Conf]
  39. Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan
    Derandomization of auctions. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:619-625 [Conf]
  40. Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin
    Competitive generalized auctions. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:72-81 [Conf]
  41. Andrew V. Goldberg, Alberto Marchetti-Spaccamela
    On Finding the Exact Solution of a Zero-One Knapsack Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:359-368 [Conf]
  42. Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
    Parallel Symmetry-Breaking in Sparse Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:315-324 [Conf]
  43. Andrew V. Goldberg, Michael Sipser
    Compression and Ranking [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:440-448 [Conf]
  44. Andrew V. Goldberg, Robert Endre Tarjan
    A New Approach to the Maximum Flow Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:136-146 [Conf]
  45. Andrew V. Goldberg, Robert Endre Tarjan
    Solving Minimum-Cost Flow Problems by Successive Approximation [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:7-18 [Conf]
  46. Andrew V. Goldberg, Robert Endre Tarjan
    Finding Minimum-Cost Circulations by Canceling Negative Cycles [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:388-397 [Conf]
  47. Andrew V. Goldberg
    Recent Developments in Maximum Flow Algorithms (Invited Lecture). [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:1-10 [Conf]
  48. Andrew V. Goldberg
    Selecting Problems for Algorithm Evaluation. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:1-11 [Conf]
  49. Boris V. Cherkassky, Andrew V. Goldberg
    On Implementing the Push-Relabel Method for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:4, pp:390-410 [Journal]
  50. Tomasz Radzik, Andrew V. Goldberg
    Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:3, pp:226-242 [Journal]
  51. Andrew V. Goldberg, Alexander V. Karzanov
    Path Problems in Skew-Symmetric Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:3, pp:353-382 [Journal]
  52. Ted Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin
    Approximating Matchings in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:3, pp:115-118 [Journal]
  53. Andrew V. Goldberg
    Processor-Efficient Implementation of a Maximum Flow Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:4, pp:179-185 [Journal]
  54. Andrew V. Goldberg
    A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:5, pp:249-256 [Journal]
  55. Andrew V. Goldberg, Serge A. Plotkin
    Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:4, pp:241-245 [Journal]
  56. Andrew V. Goldberg, Robert Endre Tarjan
    A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:5, pp:265-271 [Journal]
  57. Andrew V. Goldberg, Satish Rao
    Beyond the Flow Decomposition Barrier. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:5, pp:783-797 [Journal]
  58. Andrew V. Goldberg, Robert Endre Tarjan
    Finding minimum-cost circulations by canceling negative cycles. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:4, pp:873-886 [Journal]
  59. Andrew V. Goldberg
    An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:1, pp:1-29 [Journal]
  60. Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
    Sublinear-Time Parallel Algorithms for Matching and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:2, pp:180-213 [Journal]
  61. Andrew V. Goldberg, Kostas Tsioutsiouliklis
    Cut Tree Algorithms: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:51-83 [Journal]
  62. Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin
    Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1998, v:3, n:, pp:8- [Journal]
  63. Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert Endre Tarjan
    Finding minimum-cost flows by double scaling. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:243-266 [Journal]
  64. Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
    Shortest paths algorithms: Theory and experimental evaluation. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:73, n:, pp:129-174 [Journal]
  65. Andrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan
    Use of dynamic trees in a network simplex algorithm for the maximum flow problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:277-290 [Journal]
  66. Andrew V. Goldberg, Alexander V. Karzanov
    Maximum skew-symmetric flows and matchings. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:100, n:3, pp:537-568 [Journal]
  67. Andrew V. Goldberg, Robert Kennedy
    An efficient cost scaling algorithm for the assignment problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:153-177 [Journal]
  68. Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
    Buckets, Heaps, Lists, and Monotone Priority Queues. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1326-1346 [Journal]
  69. Andrew V. Goldberg
    Scaling Algorithms for the Shortest Paths Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:3, pp:494-504 [Journal]
  70. Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
    Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:140-150 [Journal]
  71. Andrew V. Goldberg, Michael Sipser
    Compression and Ranking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:524-536 [Journal]
  72. Andrew V. Goldberg, Robert Kennedy
    Global Price Updates Help. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:4, pp:551-572 [Journal]
  73. Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
    Parallel Symmetry-Breaking in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:4, pp:434-446 [Journal]
  74. Andrew V. Goldberg, Satish Rao
    Flows in Undirected Unit Capacity Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:1, pp:1-5 [Journal]
  75. Andrew V. Goldberg, Bruce M. Maggs, Serge A. Plotkin
    A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:3, pp:321-326 [Journal]
  76. Andrew V. Goldberg
    Point-to-Point Shortest Path Algorithms with Preprocessing. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:88-102 [Conf]
  77. Maxim A. Babenko, Jonathan Derryberry, Andrew Goldberg, Robert Endre Tarjan, Yunhong Zhou
    Experimental Evaluation of Parametric Max-Flow Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:256-269 [Conf]
  78. Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck
    Better Landmarks Within Reach. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:38-51 [Conf]

  79. Two-Level Push-Relabel Algorithm for the Maximum Flow Problem. [Citation Graph (, )][DBLP]


  80. An Experimental Study of Minimum Mean Cycle Algorithms. [Citation Graph (, )][DBLP]


  81. Shortest Path Feasibility Algorithms: An Experimental Evaluation. [Citation Graph (, )][DBLP]


  82. The Partial Augment-Relabel Algorithm for the Maximum Flow Problem. [Citation Graph (, )][DBLP]


  83. Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. [Citation Graph (, )][DBLP]


  84. Alternative Routes in Road Networks. [Citation Graph (, )][DBLP]


Search in 0.079secs, Finished in 0.083secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002