Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
- 31 May 2000
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 35 (2), 169-188
- https://doi.org/10.1006/jagm.2000.1079
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The cell probe complexity of dynamic data structuresPublished by Association for Computing Machinery (ACM) ,1989
- The nearest common ancestor in a dynamic treeActa Informatica, 1988
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 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