The level Ancestor problem simplified

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2286, Issue , 2002, Pages 508-515

  Bender, Michael A ^a   Farach Colton, Martín ^b  

^a Stony Brook University   (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL SYSTEMS;

OPTIMAL SOLUTIONS; PREPROCESS; ROOTED TREES; SIMPLE ALGORITHM;

QUERY PROCESSING;

EID: 84937410193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_44     Document Type: Conference Paper

References (14)

1. S. Alstrup and J. Holm. Improved algorithms for finding level-ancestors in dynamic trees. In 27th International Colloquium on Automata, Languages and Programming (ICALP ’00), LNCS. 1853, pages 73–84, 2000.
2. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In 41st Annual Symposium on Foundations of Computer Science (FOCS), pages 399–409, 2000.
3. M. A. Bender and M. Farach-Colton. The LCA problem revisited. In LATIN, pages 88–94, 2000.
4. O. Berkman and U. Vishkin. Recursive *-tree parallel data-structure. In Proc. Of the 30th IEEE Annual Symp. on Foundation of Computer Science, pages 196–202, 1989.
5. O. Berkman and U. Vishkin. Recursive star-tree parallel data structure. SIAM J. Comput., 22(2): 221–242, Apr. 1993.
6. O. Berkman and U. Vishkin. Finding level-ancestors in trees. J. Comput. Syst. Sci., 48(2): 214–230, Apr. 1994.
7. R. Cole and R. Hariharan. Dynamic LCA queries on trees. In Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 235–244, 1999.
8. P. F. Dietz. Finding level-ancestors in dynamic trees. In Workshop on Algorithms and Data Structures, pages 32–40, 1991.
9. H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. In Proc. of the 16th Ann. ACM Symp. on Theory of Computing, pages 135–143, 1984.
10. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. Comput., 13(2): 338–355, 1984.
11. B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput., 17: 1253–1262, 1988.
12. R. E. Tarjan. Applications of path compression on balanced trees. Journal of the ACM, 26(4): 690–715, Oct. 1979.
13. B. Wang, J. Tsai, and Y. Chuang. The lowest common ancestor problem on a tree with unfixed root. Information Sciences, 119: 125–130, 1999.
14. Z. Wen. New algorithms for the LCA problem and the binary tree reconstruction problem. Inf. Process. Lett., 51(1): 11–16, 1994.