Worst-case analysis of the set-union problem with extended backtracking
- 1 October 1989
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 68 (1) , 57-70
- https://doi.org/10.1016/0304-3975(89)90119-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union ProblemSIAM Journal on Computing, 1986
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- Prolog - the language and its implementation compared with LispACM SIGPLAN Notices, 1977
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973
- Organization and maintenance of large ordered indexesActa Informatica, 1972