next up previous
Next: Selected Technical Reports Up: List of Publications Previous: Papers Submitted to Journals

Conferences

  1. Experimental Evaluation of Parametric Maximum Flow Algorihtms by M. Babenko, J. Derryberry, A. V. Goldberg, R. E. Tarjan, and Y. Zhou, Workshop on Experimental Algorithms (WEA), Rome, Italy, 2007.
    Paper (pdf)
  2. Better Landmarks within Reach by A. V. Goldberg, H. Kaplan, and R. F. Werneck, Workshop on Experimental Algorithms (WEA), Rome, Italy, 2007.
    Paper (pdf)
    A preliminary version appeared at the 9th DIMACS Implementation Challenge Workshop.
    Workshop version (pdf)
  3. Point-to-Point Shortest Path Algorithms with Preprocessing by A. V. Goldberg, Invited Lecture, Current Trends in Theory and Practice of Computer Science (SOFSEM), Harrachov, Czech Republic, 2007.
    Paper (pdf)
  4. Routing in Networks with Low Doubling Dimension by I. Abraham, C. Gavoille, A. V. Goldberg, D. Malkhi, The 26th International Conference on Distributed Computing Systems (ICDCS), Lisbon, Portugal, 2006.
    Paper (pdf)
  5. Reach for A*: Efficient Point-to-Point Shortest Path Algorithm by A.  V. Goldberg, H. Kaplan and R. Werneck, SIAM Workshop on Algorithms Engineering and Experimentation (ALENEX '06), Miami, 2006.
    Paper (pdf)
  6. Derandomization of Auctions, by G. Aggarwal, A. Fiat, A. V. Goldberg, J. Hartline, N. Immorlica, M. Sudan, 37th ACM Symposium on Theory of Computing (STOC '05), 2005.
    Paper (pdf)
  7. Computing Point-to-Point Shortest Paths from External Memory by A.  V. Goldberg and R. Werneck, SIAM Workshop on Algorithms Engineering and Experimentation (ALENEX '05), Vancouver, Canada, 2005.
    Paper (pdf)
  8. Computing the Shortest Path: $ A^*$ Search Meets Graph Theory, by A.  V. Goldberg and C. Harrelson, 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '05), Vancouver, Canada, 2005.
    Paper (pdf) / Copyright
  9. Collusion-Resistant Mechanisms for Single-Parameter Agents by A.  V. Goldberg and J. D. Hartline, 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '05), Vancouver, Canada, January 2005.
    Paper (pdf) / Copyright
  10. A Lower Bound on the Competitive Ratio of Truthful Auctions by A.  V. Goldberg, J. Hartline, A. Karlin, and M. Saks, 21st STACS, Montpellier, France, March 2004.
    Paper (postscript) / Copyright
  11. On Memory-Bound Functions for Fighting Spam by C. Dwork, A.  V. Goldberg, and M. Naor, Crypto '03, Santa Barbara, CA, 2003.
    Paper (postscript) / Copyright
  12. Envy-Free Auctions for Digital Goods by A.  V. Goldberg and J. D. Hartline, ACM Conference on Electronic Commerce (EC '03), San Diego, CA, 2003.
    Paper (postscript) / Copyright
  13. Competitiveness via Consensus by A.  V. Goldberg and J. D. Hartline, 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '03), Baltimore, MD, January 2003.
    Paper (postscript) / Copyright
  14. Truthful and Competitive Double Auctions by K. Deshmukh, A. V. Goldberg, J. D. Hartline, and A. R. Karlin, 10th European Symposium on Algorithms (ESA '02), Rome, Italy, September 2002.
    Paper (postscript) / Copyright
  15. Competitive Generalized Auctions by A. Fiat, A. V. Goldberg, J. D. Hartline, and A. Karlin, 34th ACM Symposium on Theory of Computing (STOC '02), May 2002.
    Paper (postscript) / Copyright
  16. Shortest Path Algorithms: Engineering Aspects (INVITED LECTURE) by A. V. Goldberg, International Symposium on Algorithms and Computation (ISAAC '01), Christchurch, New Zealand, December 2001.
    Paper (postscript) / Copyright
  17. A Simple Shortest Path Algorithm with Linear Average Time by A. V. Goldberg, 9th European Symposium on Algorithms (ESA '01), Aarhus, Denmark, 230-241, August 2001.
    Paper (postscript) / Copyright
  18. Competitive Auctions for Multiple Digital Goods by A. V. Goldberg and J. D. Hartline, 9th European Symposium on Algorithms (ESA '01), Aarhus, Denmark, 416-427, August 2001.
    Paper (postscript) / Copyright
  19. Competitive Auctions and Digital Goods by A.  V. Goldberg, J. D. Hartline and A. Wright, 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '01), Washington, DC, 735-744, January 2001.

  20. A Prototype Implementation of Archival Intermemory by Y. Chen, J. Edler, A. V. Goldberg, A. Gottlieb, S. Sobti, and P. N. Yianilos, The Fourth ACM Conference on Digital Libraries (DL '99), Berkeley, CA, August 1999.

  21. Selecting Problems for Algorithm Evaluation (INVITED LECTURE) by A. V. Goldberg, The Third Workshop on Algorithm Engineering (WAE '99), London, UK, July 1999.

  22. Cut Tree Algorithms, by A.  V. Goldberg and K. Tsioutsiouliklis, 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, pages 376-385, January 1999.

  23. Combinatorial Algorithms Test Sets (CATS): The ACM/EATCS Platform for Experimental Research, by A.  V. Goldberg and B. M. E. Moret, 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, pages S913-S914, January 1999.

  24. Recent Developments in Maximum Flow Algorithms (INVITED LECTURE) by A. V. Goldberg Sixth Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 1998.

  25. An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow by A. V. Goldberg, J. D. Oldham, S. Plotkin, and C. Stein, Sixth Conference on Integer Programming and Combinatorial Optimization Houston, TX, June 1998.

  26. Towards an Archival Intermemory by A. V. Goldberg and P. N. Yianilos, IEEE Advances in Digital Libraries Conference, Santa Barbara, CA, pages 147-156, April 1998.

  27. Flows in Undirected Unit Capacity Networks by A. V. Goldberg and S. Rao, 38th IEEE Symposium on Foundations of Computer Science, Miami, FL, pages 32-34, October 1997.

  28. Beyond the Flow Decomposition Barrier by A. V. Goldberg and S. Rao, 38th IEEE Symposium on Foundations of Computer Science, Miami, FL, October 1997.

  29. Augment or Push? A Computational Study of Bipartite Matching and Unit Capacity Flow Algorithms by B. V. Cherkassky, A. V. Goldberg, P. Martin, J. C. Setubal, and J. Stolfi, Proceedings of the first Workshop on Algorithm Engineering (WAE '97), pages 1-10, Venice, Italy, September 1997.

  30. Experimental Study of Minimum Cut Algorithms by C. S. Chekuri, A. V. Goldberg, D. R. Karger, M. S. Levine, and C. Stein, 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 324-333, January 1997.
    Related software.
  31. Buckets, Heaps, Lists, and Monotone Priority Queues by B. V. Cherkassky, A. V. Goldberg, and C. Silverstein, 8th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1997.
    Related software.
  32. Experimental Evaluation of Hot Queues, by A. V. Goldberg and C. Silverstein, The Fifth DIMACS Implementation Challenge: Priority Queues, Dictionaries, and Multi-Dimensional Point Sets, New Brunswick, NJ, October 1996.

  33. What to Solve: Problems for Algorithm Evaluation, by A. V. Goldberg, The Fifth DIMACS Implementation Challenge: Priority Queues, Dictionaries, and Multi-Dimensional Point Sets, New Brunswick, NJ, October 1996.

  34. Negative-Cycle Detection Algorithms by B. V. Cherkassky and A. V. Goldberg, 4th European Symposium on Algorithms (ESA '96), Barcelona, Spain, September 1996.

  35. Implementations of Dijkstra's Algorithm Based on Multi-Level Buckets by A. V. Goldberg and C. Silverstein, Network Optimization Conference 1996, Gainesville, Florida, February 1996.

  36. Maximum Skew-Symmetric Flows by A. V. Goldberg and A. V. Karzanov, 3rd European Symposium on Algorithms (ESA '95), Corfu, Greece, pages 155-170, September 1995.

  37. On Implementing Push-Relabel Method for the Maximum Flow Problem by B. V. Cherkassky and A. V. Goldberg, 4th Integer Programming and Combinatorial Optimization Conference, Copenhagen, Denmark, pages 157-171, May 1995.
    Related software.
  38. Optimization Algorithms for Large Networks (INVITED LECTURE) by A. V. Goldberg 2nd European Symposium on Algorithms (ESA '94), Utrecht, the Netherlands, pages 1-9, September 1994.

  39. Shortest Paths Algorithms: Theory and Experimental Evaluation by B. V. Cherkassky, A. V. Goldberg, and T. Radzik, 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VI, pages 516-525, January 1994.

  40. Path Problems in Skew-Symmetric Graphs by A. V. Goldberg and A. V. Karzanov, 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VI, pages 526-535, January 1994.

  41. Improved Approximation Algorithms for Network Design Problems by M. Goemas, A. V. Goldberg, S. A. Plotkin, D. Shmoys, É. Tardos, and D. Williamson, 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VI, pages 223-232, January 1994.

  42. An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm by A. V. Goldberg, 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, pages 251-266, April 1993.
    Related software.
  43. Scaling Algorithms for the Shortest Paths Problem by A. V. Goldberg, 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, pages 222-231, January 1993.

  44. Experimental Evaluation of the Push-Ralabel Method for the Minimum-Cost Flow Problem by A. V. Goldberg and M. Kharitonov, DIMACS Workshop on Experimental Analysis of Algorithms: Network Flows and Matching, New Brunswick, NJ, pages 100-111, October 1991.

  45. Experiments with the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine by A. V. Goldberg and M. Kharitonov, DIMACS Workshop on Experimental Analysis of Algorithms: Network Flows and Matching, New Brunswick, NJ, pages 56-72, October 1991.

  46. Tight Bounds on the Minimum-Mean Cycle Cancellations and Related Results by T. Radzik and A. V. Goldberg, 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pages 110-119, January 1991.

  47. Network Decomposition and Locality in Distributed Computation by B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin, 30th IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, pages 364-369, October 1989.

  48. Interior-Point Methods in Parallel Computation by A. V. Goldberg, S. A. Plotkin, D. Shmoys, and É. Tardos, 30th IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, pages 350-355, October 1989.

  49. Lower Bounds for Pseudorandom Number Generators by M. Kharitonov, A. V. Goldberg, and M. Yung, 30th IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, pages 242-247, October 1989.

  50. Sublinear-Time Parallel Algorithms for Matching and Related Problems by A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya, 29th IEEE Symposium on Foundations of Computer Science, White Plains, NY, pages 432-443, October 1988.

  51. Combinatorial Algorithms for the Generalized Circulation Problem by A. V. Goldberg, S. A. Plotkin, and É. Tardos, 29th IEEE Symposium on Foundations of Computer Science, White Plains, NY, pages 174-185, October 1988.

  52. Finding Minimum-Cost Circulations by Canceling Negative Cycles by A. V. Goldberg and R. E. Tarjan, 20th ACM Symposium on Theory of Computing, Chicago, IL, pages 388-397, May 1988.

  53. Solving Minimum-Cost Flow Problems by Successive Approximation by A. V. Goldberg and R. E. Tarjan, 19th ACM Symposium on Theory of Computing, New York, NY, pages 7-18, May 1987.

  54. Parallel Symmetry-Breaking in Sparse Graphs by A. V. Goldberg, S. A. Plotkin, and G. E. Shannon, 19th ACM Symposium on Theory of Computing, New York, NY, pages 315-324, May 1987.

  55. A New Approach to the Maximum Flow Problem by A. V. Goldberg and R. E. Tarjan, 18th ACM Symposium on Theory of Computing, Berkeley, CA, pages 136-146, May 1986.

  56. GEM: A Generator of Environments for Metaprogramming by A. V. Goldberg and K. J. Lieberherr, ACM Softfair II, San Francisco, CA, pages 86-95, December 1985.

  57. Efficient Test Generation Algorithms by A. V. Goldberg and K. J. Lieberherr, International Test Conference, Philadelphia, PA, pages 508-516, November 1985.

  58. Grammar-Based Metaprogramming Techniques and Their Applications by A. V. Goldberg and K. J. Lieberherr, IEEE International Conference on Computer Design, Port Chester, NY, pages 541-544, October 1985.

  59. Compression and Ranking by A. V. Goldberg and M. Sipser, 17th ACM Symposium on Theory of Computing, Providence, RI, pages 440-448, May 1985.

  60. On Finding the Exact Solution of a Zero-One Knapsack Problem by A. V. Goldberg and A. Marchetti-Spaccamela, 16th ACM Symposium on Theory of Computing, Washington, DC, pages 359-368, April 1984.

next up previous
Next: Selected Technical Reports Up: List of Publications Previous: Papers Submitted to Journals
Andrew 2007-10-20