The LCA problem revisited

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

Volumn 1776 LNCS, Issue , 2000, Pages 88-94

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

^a Stony Brook University   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEAST COMMON ANCESTORS; PRAM ALGORITHMS; SIMPLE ALGORITHM;

ALGORITHMS; INFORMATION SCIENCE;

LIFE CYCLE;

EID: 84896788505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10719839_9     Document Type: Conference Paper

References (3)

1. O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin. Highly parallelizable problems. In Proc. of the 21st Ann. ACM Symp. on Theory of Computing, pages 309-319, 1989.
2. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. Comput., 13(2):338-355, 1984.
3. B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput., 17:1253-1262, 1988.