The LCA Problem Revisited

  • Michael A. Bender
  • Martín Farach-Colton
Conference paper

DOI: 10.1007/10719839_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1776)
Cite this paper as:
Bender M.A., Farach-Colton M. (2000) The LCA Problem Revisited. In: Gonnet G.H., Viola A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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