A randomized parallel algorithm for planar graph isomorphism
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Supereffective slow-down of parallel computations
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Efficient parallel shortest-paths in digraphs with a separator decomposition
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the Parallel Computation of the Algebraic Path Problem
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |