The Level Ancestor Problem Simplified
Authors:
- 14 March 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 508-515
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Cache-oblivious B-trees2002
- Improved Algorithms for Finding Level Ancestors in Dynamic Trees2000
- The lowest common ancestor problem on a tree with an unfixed rootInformation Sciences, 1999
- Finding level-ancestors in treesJournal of Computer and System Sciences, 1994
- Recursive Star-Tree Parallel Data StructureSIAM Journal on Computing, 1993
- Recursive *-tree parallel data-structure1989
- On Finding Lowest Common Ancestors: Simplification and ParallelizationSIAM Journal on Computing, 1988
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Scaling and related techniques for geometry problems1984
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979