动态树的弹性水平祖先、瓶颈和最低共同祖先
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
摘要：
我们研究的问题，设计一个\emph{resilient}数据结构，保持树下的故障RAM模型[Finocchi和Italiano，STOC'04]，其中多达$δ$内存字可以被破坏的对手。我们的数据结构存储了一个有根的动态树，可以通过添加新的叶子更新，需要线性大小，并支持\emph{resilient}（加权）级祖先查询，最低共同祖先查询，并在$O(δ)$最坏情况下每次操作的时间瓶颈顶点查询。
英文摘要：
We study the problem of designing a \emph{resilient} data structure maintaining a tree under the Faulty-RAM model [Finocchi and Italiano, STOC'04] in which up to $δ$ memory words can be corrupted by an adversary. Our data structure stores a rooted dynamic tree that can be updated via the addition of new leaves, requires linear size, and supports \emph{resilient} (weighted) level ancestor queries, lowest common ancestor queries, and bottleneck vertex queries in $O(δ)$ worst-case time per operation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
