The LCA Problem Revisited

We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable. Interestingly, this algorithm is a sequentialization of a previously known PRAM algorithm of Berkman, Breslauer, Galil, Schieber, and Vishkin [1].

• Type: Conference
• Year: 2000
• Where: LATIN
• Authors: Michael A. Bender, Martin Farach-Colton
• Keywords: Algorithm, Information Management, LATIN 2000, Least Common Ancestor, Optimal Lca Computation