We study the problem of designing a 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 resilient (weighted) level ancestor queries, lowest common ancestor queries, and bottleneck vertex queries in O(δ) worst-case time per operation.
Titolo: | Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees | |
Autori: | ZICCARDI, ISABELLA (Corresponding) | |
Data di pubblicazione: | 2021 | |
Serie: | ||
Handle: | http://hdl.handle.net/11697/176447 | |
Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.