Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
On the single-operation worst-case time complexity of the disjoint set union problem
SIAM Journal on Computing
A lower bound on the complexity of the union-split-find problem
SIAM Journal on Computing
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
New techniques for the union-find problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Union-copy structures and dynamic segment trees
Journal of the ACM (JACM)
Lower bounds for union-split-find related problems on random access machines
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Alpha-algorithms for incremental planarity testing (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Algorithms and theory of computation handbook
| Hi-index | 0.00 |