Worst-case Analysis of Set Union Algorithms
- 30 March 1984
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 31 (2), 245-281
- https://doi.org/10.1145/62.2160
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A complement to Tarjan's result about the lower bound on the complexity of the set union problemInformation Processing Letters, 1980
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- A new data structure for the union-find problemInformation Processing Letters, 1979
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- Efficiency of Equivalence AlgorithmsPublished by Springer Science and Business Media LLC ,1972
- An improved equivalence algorithmCommunications of the ACM, 1964
- Zum Hilbertschen Aufbau der reellen ZahlenMathematische Annalen, 1928