The LCA Problem Revisited

  • Michael A. Bender
  • Martín Farach-Colton
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1776)


We present a very simple algorithm for the Least Common Ancestors problem. We thus dispel the frequently held notion that optimal LCA computation is unwieldy and unimplementable. Interestingly, this algorithm is a sequentialization of a previously known PRAM algorithm.


Query Time Array Reference Euler Tour Folk Wisdom Rightmost Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


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

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Michael A. Bender
    • 1
  • Martín Farach-Colton
    • 2
  1. 1.Department of Computer ScienceState University of New York at Stony BrookStony BrookUSA
  2. 2.Department of Computer ScienceRutgers UniversityPiscatawayUSA

Personalised recommendations