English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study the problem of designing a \emph{resilient} data structuremaintaining a tree under the Faulty-RAM model [Finocchi and Italiano, STOC'04]in which up to $\delta$ memory words can be corrupted by an adversary. Our datastructure stores a rooted dynamic tree that can be updated via the addition ofnew leaves, requires linear size, and supports \emph{resilient} (weighted)level ancestor queries, lowest common ancestor queries, and bottleneck vertexqueries in $O(\delta)$ worst-case time per operation.

Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees