ACM Computing Surveys (CSUR)
Finding Lowest Common Ancestors in Parallel
IEEE Transactions on Computers
Optimal Graph Algorithms on a Fixed-Size Linear Array
IEEE Transactions on Computers
Efficient parallel algorithms for path problems in directed graphs
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Efficient parallel algorithms for finding biconnected components of some intersection graphs
CSC '91 Proceedings of the 19th annual conference on Computer Science
IEEE Transactions on Parallel and Distributed Systems
A parallel algorithm for k-minimum spanning trees
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs
Computational Optimization and Applications
A self-stabilizing algorithm for bridge finding
Distributed Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
On the parallel computation of the biconnected and strongly connected co-components of graphs
Discrete Applied Mathematics
An optimal distributed algorithm for finding articulation points in a network
Computer Communications
Hi-index | 0.02 |