The LCA Problem Revisited

2000/01/01 by Michael A. Bender, Martín Farach-Colton, Martı́n Farach-Colton · 6 citations
Computer Science · Mathematics · #Algorithm #Computation #Computer science #Evolutionary Algorithms and Applications #Mathematical optimization #Mathematics #Simple (philosophy) #Theoretical computer science

paper · doi:10.1007/10719839_9

crossref issued 2000/01/01 · crossref published 2000/01/01 · crossref published-print 2000/01/01 · openalex publication_date 2000/01/01 · crossref created 2007/04/11 · crossref published-online 2007/04/12 · crossref deposited 2019/08/31 · openalex created_date 2025/10/10 · crossref indexed 2026/07/27 · openalex updated_date 2026/07/29

Citations

• Fast Algorithms for Finding Nearest Common Ancestors

Cited by

• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
• Lowest common ancestors in trees and directed acyclic graphs
• A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
• Linear-Space Data Structures for Range Mode Query in Arrays
• Lowest common ancestor [wikipedia]