A data structure for dynamic trees
- 30 June 1983
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 26 (3), 362-391
- https://doi.org/10.1016/0022-0000(83)90006-5
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Biased Search TreesSIAM Journal on Computing, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- An O(EVIog2V) algorithm for the maximal flow problemJournal of Computer and System Sciences, 1980
- An Efficient Method for Storing Ancestor Information in TreesSIAM Journal on Computing, 1979
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- On Finding Lowest Common Ancestors in TreesSIAM Journal on Computing, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- The Art of Computer Programming, Vol. 3: Sorting and SearchingMathematics of Computation, 1974
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973