Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Recursive star-tree parallel data structure
SIAM Journal on Computing
New algorithms for the LCA problem and the binary tree reconstruction problem
Information Processing Letters
Finding level-ancestors in trees
Journal of Computer and System Sciences
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
The lowest common ancestor problem on a tree with an unfixed root
Information Sciences: an International Journal
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Recursive *-tree parallel data-structure
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
The level-ancestor problem on pure pointer machines
Information Processing Letters
Succinct ordinal trees with level-ancestor queries
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct ordinal trees with level-ancestor queries
ACM Transactions on Algorithms (TALG)
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
Theoretical Computer Science
Center location problems on tree graphs with subtree-shaped customers
Discrete Applied Mathematics
Opportunistic data structures for range queries
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Succinct representations of permutations and functions
Theoretical Computer Science
Range minimization problems in path-facility location on trees
Discrete Applied Mathematics
| Hi-index | 0.00 |
We present a very simple algorithm for the Level Ancestor Problem. A Level Ancestor Query LA(v, d) requests the depth d ancestor of node v. The Level Ancestor Problem is thus: preprocess a given rooted tree T to answer level ancestor queries. While optimal solutions to this problem already exist, our new optimal solution is simple enough to be taught and implemented.