The LCA problem revisited (2000)
Cached
Download Links
by
Michael A. Bender
,
Martín Farach-colton
| Venue: | In Latin American Theoretical INformatics |
| Citations: | 144 - 6 self |
BibTeX
@INPROCEEDINGS{Bender00thelca,
author = {Michael A. Bender and Martín Farach-colton},
title = {The LCA problem revisited},
booktitle = {In Latin American Theoretical INformatics},
year = {2000},
pages = {88--94},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1
Citations
| 285 | Fast algorithms for finding nearest common ancestors - Harel, Tarjan - 1984 |
| 161 | On finding lowest common ancestors: simplification and parallelization - Schieber, Vishkin - 1988 |
| 40 | Highly parallelizable problems - Berkman, Galil, et al. - 1989 |
