@inproceedings{79e0a58ca03941aeba333e58b3d3bef8,
title = "The LCA problem revisited",
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.",
author = "Bender, \{Michael A.\} and Mart{\'i}n Farach-Colton",
year = "2000",
doi = "10.1007/10719839\_9",
language = "English",
isbn = "3540673067",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "88--94",
booktitle = "LATIN 2000",
note = "4th Latin American Symposium on Theoretical Informatics, LATIN 2000 ; Conference date: 10-04-2000 Through 14-04-2000",
}