On the single-operation worst-case time complexity of the disjoint set union problem

The cell probe complexity of dynamic data structures

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing

Lower bounds for the union-find and the split-find problem on pointer machines

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

Data structures and algorithms for disjoint set union problems

ACM Computing Surveys (CSUR)

On pointers versus addresses

Journal of the ACM (JACM)

Union-copy structures and dynamic segment trees

Journal of the ACM (JACM)

Finding connected components on a scan line array processor

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

Worst-case and amortised optimality in union-find (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Dynamic two-connectivity with backtracking

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

Union-find with deletions

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium

Worst-case update times for fully-dynamic all-pairs shortest paths

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

Intersection reporting on two collections of disjoint sets

Information Sciences: an International Journal

Topics in data structures

Algorithms and theory of computation handbook

Don't rush into a union: take time to find your roots

Proceedings of the forty-third annual ACM symposium on Theory of computing

Computational issues in exploiting dependent and-parallelism in logic programming: leftness detection in dynamic search trees

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Union-find with constant time deletions

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

An optimal data structure to handle dynamic environments in non-deterministic computations

Computer Languages, Systems and Structures