Andrew V. Goldberg's Home Page

Andrew V. Goldberg

Andrew Goldberg's research interests are in design, analysis, and computational evaluation of algorithms and data structures, computational game theory, electronic commerce, point-to-point networks, parallel and distributed algorithms, and complexity theory. His algorithms are widely used in industry and academia. Goldberg got his Ph.D. degree in Computer Science from MIT in 1987, where he was a Hertz Foundation Fellow. Before joining Microsoft Research in 2002, he worked at GTE Laboratories, Stanford University, NEC Research Institute, and InterTrust Technologies, Inc. Goldberg received a number of awards for his research contributions, including the NSF Presidential Young Investigator Award and the ONR Young Investigator Award.



Microsoft Research -- Silicon Valley
1065 La Avenida
Mountain View, CA 94043

+1 650 693-1787 (phone)
+1 650 693-2005 (FAX)
< last name > at microsoft dot com

Current Professional Activities

9th DIMACS Implementation Challenge - Shortest Paths

On now! Visit the Challenge home page .

Optimization Library

A library of network optimization software, including related papers and copyright information.


A list of selected publications is available in html or PDF .
The html version has links to some of the papers.

Selected Recent Papers

Slides of Talks

DIKU Summer School on Shortest Paths (PATH05)

Reach for A*: an Efficient Point-to-Point Shortest Path Algorithm

Point-to-Point Shortest Path Algorithms with Preprocessing (SOFSEM07)


Available in html, PDF.

Research Interests

Available in html or postscript.

Research Contributions

Available in html or postscript.

Combinatorial Algorithms Test Sets (CATS)

(Not maintained)

CATS maximum flow page

Number of visitors since 1/1/02: