@inproceedings{9a7baa1184d14633ba5ac6f311ac7866,
title = "The level Ancestor problem simplified",
abstract = "We present a very simple algorithm for the Level Ancestor Problem. A Level Ancestor Query LA(v, d) requests the depth d ancestor of node v. The Level Ancestor Problem is thus: preprocess a given rooted tree T to answer level ancestor queries. While optimal solutions to this problem already exist, our new optimal solution is simple enough to be taught and implemented.",
author = "Bender, {Michael A.} and Mart{\'i}n Farach-Colton",
note = "Funding Information: ∗Corresponding author. E-mail addresses: bender@cs.sunysb.edu (M.A. Bender), martin@farach-colton.com (M. Farach-Colton). 1Supported in part by Sandia National Laboratories and NSF Grants EIA-0112849, CCR-0208670, and ACI-0324974. 2Partially supported by NSF CCR 9820879. This work was performed while the author was working at Google, Inc. Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 5th Latin American Symposium on Theoretical Informatics, LATIN 2002 ; Conference date: 03-04-2002 Through 06-04-2002",
year = "2002",
doi = "10.1007/3-540-45995-2_44",
language = "English (US)",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "508--515",
editor = "Sergio Rajsbaum",
booktitle = "LATIN 2002",
address = "Germany",
}