Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Clique partitions, graph compression and speeding-up algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
On Diameter Verification and Boolean Matrix Multiplication.
On Diameter Verification and Boolean Matrix Multiplication.
Hardware fault containment in scalable shared-memory multiprocessors
Proceedings of the 24th annual international symposium on Computer architecture
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
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
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Well-separated pair decomposition for the unit-disk graph metric and its applications
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Compact roundtrip routing in directed networks
Journal of Algorithms
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
Fast computation of empirically tight bounds for the diameter of massive graphs
Journal of Experimental Algorithmics (JEA)
Determining the diameter of small world networks
Proceedings of the 20th ACM international conference on Information and knowledge management
On the complexity of the “most general” firing squad synchronization problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |