Finding connected components in O(log n loglog n) time on the EREW PRAM

An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures

A comparison of parallel algorithms for connected components

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures

Towards modeling the performance of a fast connected components algorithm on parallel machines

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing

Computing faces in segment and simplex arrangements

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Finding minimum spanning forests in logarithmic time and linear work using random sampling

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures

On the parallel time complexity of undirected connectivity and minimum spanning trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Using randomized sparsification to approximate minimum cuts

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Concurrent threads and optimal parallel minimum spanning trees algorithm

Journal of the ACM (JACM)

Simpler and Faster Vertex-Connectivity Augmentation Algorithms

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms