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

A library of basic PRAM algorithms and its implementation in FORK

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

Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems

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

A Parallel Algorithm for Connected Components on Distributed Memory Machines

Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface

N-axioms parallel unification

Fundamenta Informaticae - Concurrency specification and programming

An O(log n log log n) space algorithm for undirected st-connectivity

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)

Journal of Parallel and Distributed Computing

N-axioms Parallel Unification

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2