The level ancestor problem simplified

Authors:
Michael A. Bender;Martín Farach-Colton
Affiliations:
Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY;Department of Computer Science, Rutgers University, Piscataway, NJ
Venue:
Theoretical Computer Science - Latin American theorotical informatics
Year:
2004

Citing 2
Cited 26

Finding level-ancestors in trees

Journal of Computer and System Sciences
Cache-oblivious B-trees

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

Squeezing succinct data structures into entropy bounds

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
When indexing equals compression: Experiments with compressing suffix arrays and applications

ACM Transactions on Algorithms (TALG)
Dynamic weighted ancestors

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Ultra-succinct representation of ordered trees

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Range Medians

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Dual-failure distance and connectivity oracles

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient data structures for range-aggregate queries on trees

Proceedings of the 12th International Conference on Database Theory
Generalized Substring Compression

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Towards Optimal Range Medians

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Fully-compressed suffix trees

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Note: On compact representations of All-Pairs-Shortest-Path-Distance matrices

Theoretical Computer Science
Fully-functional succinct trees

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Spatio-temporal range searching over compressed kinetic sensor data

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Inverted indexes for phrases and strings

Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Succinct indexes for circular patterns

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Self-Indexed Grammar-Based Compression

Fundamenta Informaticae
Cross-Document pattern matching

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Speeding up q-gram mining on grammar-based compressed texts

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Simple and efficient LZW-Compressed multiple pattern matching

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Sorted range reporting

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Localized geometric query problems

Computational Geometry: Theory and Applications
Efficient LZ78 factorization of grammar compressed text

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
The position heap of a trie

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Fingerprints in compressed strings

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Cross-document pattern matching

Journal of Discrete Algorithms
Fast layout computation of clustered networks: Algorithmic advances and experimental analysis

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a 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 to preprocess a given rooted tree T to support level ancestor queries. While optimal solutions to this problem already exist, our new optimal solution is simple enough to be taught and implemented.