@InProceedings{guala_et_al:LIPIcs.ISAAC.2021.66,
author = {Gual\`{a}, Luciano and Leucci, Stefano and Ziccardi, Isabella},
title = {{Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {66:1--66:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.66},
URN = {urn:nbn:de:0030-drops-154998},
doi = {10.4230/LIPIcs.ISAAC.2021.66},
annote = {Keywords: level ancestor queries, lowest common ancestor queries, bottleneck vertex queries, resilient data structures, faulty-RAM model, dynamic trees}
}