Skip to main content
Conference Proceedings

The LCA problem revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1776 LNCS 88-94
DOI: 10.1007/10719839_9
622Citations
Citations of this article
148Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Bender, M. A., & Farach-Colton, M. (2000). The LCA problem revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 88–94). https://doi.org/10.1007/10719839_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free