Complexity of network synchronization
Journal of the ACM (JACM)
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Introduction to algorithms
On the exponent of the all pairs shortest path problem
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A new upper bound on the complexity of the all pairs shortest path problem
Information Processing Letters
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Witnesses for Boolean matrix multiplication and for transitive closure
Journal of Complexity
Polylog-time and near-linear work approximation scheme for undirected shortest paths
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast estimation of diameter and shortest paths (without matrix multiplication)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
All pairs almost shortest paths
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing for digraphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing in directed networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Compact roundtrip routing in directed networks
Journal of Algorithms
| Hi-index | 0.00 |