Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
An all pairs shortest path algorithm with expected time O(n2logn)
SIAM Journal on Computing
A useful elementary correlation inequality
Journal of Combinatorial Theory Series A
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
A new upper bound on the complexity of the all pairs shortest path problem
Information Processing Letters
Finding the hidden path: time bounds for all-pairs shortest paths
SIAM Journal on Computing
An extension of Janson's inequality
Random Structures & Algorithms
Algorithmic theory of random graphs
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
On the all-pairs shortest-path algorithm of Moffat and Takaoka
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Shortest Paths in Random Weighted Graphs
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |