Andrew V. Goldberg

Andrew V. Goldberg's AcademicInfluence.com Rankings

Andrew V. Goldberg

Computer Science

#974

World Rank

#1010

Historical Rank

#529

USA Rank

Database

#2058

World Rank

#2163

Historical Rank

#487

USA Rank

computer-science Degrees

Download Badge

Computer Science

Andrew V. Goldberg's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Mathematics Stanford University

Similar Degrees You Can Earn

Why Is Andrew V. Goldberg Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Andrew Vladislav Goldberg is an American computer scientist working primarily on design, analysis, and experimental evaluation of algorithms. He also worked on mechanism design, computer systems, and complexity theory. Currently he is a Senior Principal Scientist at Amazon.com.

(See a Problem?)

Andrew V. Goldberg's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A new approach to the maximum flow problem (1986) (1651)
Shortest paths algorithms: Theory and experimental evaluation (1994) (965)
Quincy: fair scheduling for distributed computing clusters (2009) (953)
Computing the shortest path: A search meets graph theory (2005) (869)
A new approach to the maximum-flow problem (1988) (834)
Route Planning in Transportation Networks (2015) (629)
Beyond the flow decomposition barrier (1997) (504)
On Implementing the Push—Relabel Method for the Maximum Flow Problem (1997) (461)
Finding a Maximum Density Subgraph (1984) (406)
Parallel symmetry-breaking in sparse graphs (1987) (353)
An efficient implementation of a scaling minimum-cost flow algorithm (1993) (335)
Finding Minimum-Cost Circulations by Successive Approximation (1990) (321)
Network decomposition and locality in distributed computation (1989) (320)
Competitive auctions and digital goods (2001) (301)
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms (2006) (293)
On Memory-Bound Functions for Fighting Spam (2003) (287)
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks (2011) (256)
Improved approximation algorithms for network design problems (1994) (245)
Competitive auctions (2006) (244)
Finding minimum-cost circulations by canceling negative cycles (1988) (239)
Solving minimum-cost flow problems by successive approximation (1987) (237)
Highway dimension, shortest paths, and provably efficient algorithms (2010) (230)
Negative-cycle detection algorithms (1996) (208)
Hierarchical Hub Labelings for Shortest Paths (2012) (206)
Scaling algorithms for the shortest paths problem (1995) (200)
Network Flow Algorithms (1989) (199)
Customizable Route Planning (2011) (184)
An efficient cost scaling algorithm for the assignment problem (1995) (183)
Finding minimum-cost circulations by canceling negative cycles (1989) (181)
Computing Point-to-Point Shortest Paths from External Memory (2005) (177)
On Implementing Push-Relabel Method for the Maximum Flow Problem (1995) (171)
PHAST: Hardware-Accelerated Shortest Path Trees (2011) (166)
A heuristic improvement of the Bellman-Ford algorithm (1993) (164)
Efficient graph algorithms for sequential and parallel computers (1987) (153)
A prototype implementation of archival Intermemory (1999) (153)
Competitive generalized auctions (2002) (153)
The shortest path problem : ninth DIMACS implementation challenge (2009) (142)
Experimental study of minimum cut algorithms (1997) (140)
Finding minimum-cost flows by double scaling (2015) (128)
Graph Partitioning with Natural Cuts (2011) (126)
Towards an archival Intermemory (1998) (125)
Customizable Route Planning in Road Networks (2017) (125)
Alternative routes in road networks (2010) (123)
Combinatorial algorithms for the generalized circulation problem (1988) (119)
Buckets, heaps, lists, and monotone priority queues (1997) (111)
Compression and ranking (1985) (110)
Routing in Networks with Low Doubling Dimension (2006) (109)
Efficient maximum flow algorithms (2014) (102)
TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing (2006) (101)
Collusion-resistant mechanisms for single-parameter agents (2005) (99)
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow (1997) (94)
Maximum Flows by Incremental Breadth-First Search (2011) (92)
A Simple Shortest Path Algorithm with Linear Average Time (2001) (90)
The Shortest Path Problem (2009) (87)
Envy-free auctions for digital goods (2003) (81)
Competitive Auctions for Multiple Digital Goods (2001) (80)
Sublinear-time parallel algorithms for matching and related problems (1988) (80)
Better Landmarks Within Reach (2007) (78)
VC-Dimension and Shortest Path Algorithms (2011) (77)
Truthful and Competitive Double Auctions (2002) (75)
Recent Developments in Maximum Flow Algorithms (Invited Lecture) (1998) (69)
Reach for A*: Shortest Path Algorithms with Preprocessing (2006) (67)
Derandomization of auctions (2005) (64)
Highway Dimension and Provably Efficient Shortest Path Algorithms (2016) (59)
Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms (1998) (58)
Competitiveness via consensus (2003) (57)
Maximum skew-symmetric flows and matchings (2003) (57)
Shortest Path Algorithms: Engineering Aspects (2001) (57)
Cut Tree Algorithms: An Experimental Study (2001) (56)
Robust Distance Queries on Massive Networks (2014) (55)
Use of dynamic trees in a network simplex algorithm for the maximum flow problem (1991) (55)
Point-to-Point Shortest Path Algorithms with Preprocessing (2007) (52)
Implementations of Dijkstra’s Algorithm Based on Multi-Level Buckets (1997) (49)
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search (2015) (48)
Faster Batched Shortest Paths in Road Networks (2011) (48)
Flows in undirected unit capacity networks (1997) (47)
Navigation made personal: inferring driving preferences from GPS traces (2015) (47)
On finding the exact solution of a zero-one knapsack problem (1984) (44)
HLDB: location-based services in databases (2012) (44)
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem (2009) (42)
A Practical Shortest Path Algorithm with Linear Expected Time (2008) (41)
Hub Label Compression (2013) (40)
Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs (1987) (40)
Path problems in skew-symmetric graphs (1994) (36)
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem (2008) (36)
Global Price Updates Help (1997) (34)
Approximating Matchings in Parallel (1993) (32)
Hub Labels: Theory and Practice (2014) (32)
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems (1992) (32)
On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem (1991) (31)
A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms (1992) (30)
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths (2013) (30)
Tight bounds on the number of minimum-mean cycle cancellations and related results (1991) (30)
Exact Combinatorial Branch-and-Bound for Graph Bisection (2012) (29)
Implementation Challenge for Shortest Paths (2008) (29)
Shortest-path feasibility algorithms: An experimental evaluation (2008) (28)
An exact combinatorial algorithm for minimum graph bisection (2014) (25)
Experimental Evaluation of Parametric Max-Flow Algorithms (2007) (25)
Algorithms for Hub Label Optimization (2013) (24)
A Lower Bound on the Competitive Ratio of Truthful Auctions (2004) (24)
Robust Exact Distance Queries on Massive Networks (2014) (21)
Interior-point methods in parallel computation (1989) (20)
A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network (1989) (20)
Lower bounds for pseudorandom number generators (1989) (18)
An Experimental Study of Minimum Mean Cycle Algorithms (2009) (18)
Maximum Skew-Symmetric Flows (1995) (18)
Processor-Efficient Implementation of a Maximum Flow Algorithm (1991) (17)
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs (2016) (17)
Experimental Evaluation of a Parametric Flow Algorithm (2006) (16)
Network Flow Algorithm (1989) (16)
Selecting Problems for Algorithm Evaluation (1999) (16)
Efficient parallel algorithms for (5+1)-coloring and maximal independent set problems (1987) (15)
Cut tree algorithms (1999) (13)
Minimum-Cost Flows in Unit-Capacity Networks (2017) (13)
On the Complexity of Hub Labeling (2015) (12)
Shortest Path Feasibility Algorithms: An Experimental Evaluation (2008) (12)
Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost (1997) (11)
Heap-on-Top Priority Queues (1996) (10)
Separating Hierarchical and General Hub Labelings (2013) (10)
On implementing scaling push-relabel algorithms for the minimum-relabel algorithms for the minimum-cost flow problem (1993) (10)
Efficiency of the network simplex algorithm for the maximum flow problem (1989) (10)
Shortest Paths in Road Networks: From Practice to Theory and Back (2011) (10)
A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches (1994) (9)
Minimum Cost Flows in Graphs with Unit Capacities (2015) (9)
Combinatorial algorithms test sets CATS: the ACM/EATCS platform for experimental research (1999) (7)
Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine (1991) (6)
Customizable Route Planning in Road Networks (Extended Abstract) (2013) (6)
Book review: Potokovye Algoritmy (Flow Algorithms) by G. M. Adel''son-Vel''ski, E. A. Dinic, and A. V. Karzanov. (1990) (5)
Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine. (1992) (5)
Optimization Algorithms For Large Networks (1994) (4)
On the Complexity of Hub Labeling (Extended Abstract) (2015) (4)
New Instances for Maximum Weight Independent Set From a Vehicle Routing Application (2021) (4)
The Hub Labeling Algorithm (2013) (3)
Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings (2009) (3)
Games and Economic Behavior (2006) (3)
Sublinear-Time Parallel Algorithms (1988) (3)
Maximum Skew-Symmetric Flows and Their Applications to B-Matchings (1999) (3)
OO COMBINATORIAL ALGORITHMS FOR THE GENERALIZED CIRCULATION PROBLEM (2)
Efficient Test Generation Algorithms (1985) (2)
Computational evaluation of hot queues (1999) (2)
Hub Labeling (2-Hop Labeling) (2016) (1)
Experimental Algorithms : 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings (2016) (1)
Journal of Experimental Algorithmics (JEA) Volume 3 (1998) (1)
A Local Search Algorithm for Large Maximum Weight Independent Set Problems (2022) (1)
TRANSITIVE FORK ENVIRONMENTS AND MINIMUM COST MULTIFLOWS (1993) (1)
Minimum-Cost Flows in Unit-Capacity Networks (2017) (1)
Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (2009) (1)
Flow Problem (2005) (1)
A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems (2022) (1)
Algorithms of All Pair Shortest Path Problem (2016) (0)
M4 1 4 No.2.o>4f- *^^ Working Paper Alfred P. Sloan School of Management Finding Minimum-cost Flows Hy Double Scaling Finding Minimum-cost Flows I$y Double Scaling Finding Minimum-cost Flows by Double Scaling (2008) (0)
Implementation Challenge for Shortest Paths 2006 (2008) (0)
Truthful and Competitive Double Au (2002) (0)
Highway Dimension: From Practice to Theory and Back (2012) (0)
TheBestNurturers in Computer Science Research (2005) (0)
Alenex workshop preface (2005) (0)
Strategic directions in research in theory of computing (1997) (0)
Experimental Evaluation of the Push-Relabel Method for the Minimum-Cost Flow Problem (Extended Abstract), (1991) (0)
An exact combinatorial algorithm for minimum graph bisection (2014) (0)
Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
A method and computer program for reducing unwanted and unsolicited electronic reports (2004) (0)
Proceedings of the 15th International Symposium on Experimental Algorithms - Volume 9685 (2016) (0)
Algorithm Engineering (Dagstuhl Seminar 13391) (2013) (0)
Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (1995) (0)
MST Applications (2015) (0)
Bottleneck Distances and Steiner Trees in the Euclidean d-Space (2016) (0)
Recent Results on Hub Labeling (2014) (0)
Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
00 CD qt INETWORK FLOW ALGORITHMS (0)

This paper list is powered by the following services:

Other Resources About Andrew V. Goldberg

What Schools Are Affiliated With Andrew V. Goldberg?

Andrew V. Goldberg is affiliated with the following schools:

Andrew V. Goldberg's Academic­Influence.com Rankings