The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An &Ohgr;(n2 log n) lower bound to the shortest paths problem
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The effect of algebraic structure on the computational complexity of matrix multiplication
The effect of algebraic structure on the computational complexity of matrix multiplication
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Optimal randomized algorithms for local sorting and set-maxima
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Matroid decomposition methods for the set maxima problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Monomial bases for broken circuit complexes
European Journal of Combinatorics
Networks cannot compute their diameter in sublinear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |