Introduction to algorithms
High probability parallel transitive-closure algorithms
SIAM Journal on Computing
More time-work tradeoffs for parallel graph algorithms
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
A parallel randomized approximation scheme for shortest paths
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient parallel shortest-paths in digraphs with a separator decomposition
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Parallel Solutions of Simple Indexed Recurrence Equations
IEEE Transactions on Parallel and Distributed Systems
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Sparse distance preservers and additive spanners
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |