Algorithms for the maximum subarray problem based on matrix multiplication
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A generalization of Janson inequalities and its application to finding shortest paths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
A simpler algorithm for the all pairs shortest path problem with o(n2 log n) expected time
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A simplified algorithm for the all pairs shortest path problem with O(n2logn) expected time
Journal of Combinatorial Optimization
All-pairs shortest paths in O(n2) time with high probability
Journal of the ACM (JACM)
| Hi-index | 0.00 |