Andrew Vladislav Goldberg

Computer Networks and Communications · 1986–2015

A researcher in the Science corpus: 8 papers; trusts 6 researchers and is trusted by 8 researchers here, as inferred from the citation graph.

Subfields

• Computer Networks and Communications — 20 citations into it; #8,040 of 9,886 by trust here, #2,196 by citations
• Signal Processing — 15 citations into it; #2,962 of 7,572 by trust here, #2,911 by citations
• Computational Theory and Mathematics — 13 citations into it; #5,830 of 12,182 by trust here, #7,142 by citations
• Computer Vision and Pattern Recognition — 10 citations into it

Whom Andrew Vladislav Goldberg trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Mikkel Thorup
2. Peter Sanders
3. Dominik Schultes
4. Nils J. Nilsson
5. Daniel Delling
6. Chris Harrelson
7. Lloyd S. Shapley
8. T. Lindvall
9. Martin J. Osborne

Who trusts Andrew Vladislav Goldberg overall

1. Yuri Boykov
2. Daniel Delling
3. Santo Fortunato
4. Peter Sanders
5. Robert Geisberger
6. Michalis Potamias
7. Gary William Flake
8. Daniel A. Spielman
9. Anatoli B. Juditsky
10. Vibhav Vineet

Papers from Andrew Vladislav Goldberg's perspective

Ordered by how strongly the researchers Andrew Vladislav Goldberg trusts endorse each paper. Same corpus, a different order for every researcher.

1. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks (ALENEX/ANALC)
2. A Formal Basis for the Heuristic Determination of Minimum Cost Paths
3. Distance labeling in graphs (ACM-SIAM Symposium on Discrete Algorithms)
4. PHAST: Hardware-Accelerated Shortest Path Trees
5. Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
6. Highway Hierarchies Hasten Exact Shortest Path Queries (Embedded Systems and Applications)
7. Heuristic shortest path algorithms for transportation applications: State of the art (Computers & Operations Research)
8. Reachability and distance queries via 2-hop labels
9. ON A ROUTING PROBLEM (Probability in the engineering and informational sciences (Print))
10. Real-time routing with OpenStreetMap data (ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems)

Their papers

• Competitive auctions and digital goods (2001) — 326 citations
• A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks (2011) — 302 citations
• Reach for A*: Efficient Point-to-Point Shortest Path Algorithms (2006) — 310 citations
• Route Planning in Transportation Networks (2015) — 783 citations
• PHAST: Hardware-Accelerated Shortest Path Trees (2011) — 193 citations
• Quincy: fair scheduling for distributed computing clusters (2009) — 1,015 citations
• Computing the shortest path: A search meets graph theory (2005) — 998 citations
• A new approach to the maximum flow problem (1986)