Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees-Reference-Cited by-同舟云学术

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

Published:2022-10-08 Issue: Volume: Page:
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Gualà Luciano,Leucci Stefano^ORCID,Ziccardi Isabella

Abstract

AbstractWe 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

$$\delta $$

δ 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(\delta )$$

O ( δ ) worst-case time per operation.

Funder

Università degli Studi di Roma Tor Vergata

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00453-022-01046-3.pdf

Reference28 articles.

1. Finocchi, I., Italiano, G.F.: Sorting and searching in the presence of memory faults (without redundancy). In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC’04. New York, NY, USA: Association for Computing Machinery, pp. 101–110 (2004)

2. Finocchi, I., Grandoni, F., Italiano, G.F.: Resilient search trees. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’07. USA: Society for Industrial and Applied Mathematics, pp. 547–553 (2007)

3. Brodal, G.S., Fagerberg, R., Finocchi, I., Grandoni, F., Italiano, G.F., Jørgensen, A.G., et al.: Optimal resilient dynamic dictionaries. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) Algorithms—ESA 2007, pp. 347–358. Springer Berlin Heidelberg, Berlin (2007)

4. Jørgensen, A.G., Moruz, G., Mølhave, T.: Priority queues resilient to memory faults. In: Dehne, F.K.H.A., Sack, J., Zeh, N. (eds.) Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS’07). Lecture Notes in Computer Science, vol. 4619, pp. 127–138. Springer, Berlin (2007)

5. Italiano, G.F.: Resilient algorithms and data structures. In: Calamoneri, T., Díaz, J. (eds.) Algorithms and Complexity, Proceedings of the 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Lecture Notes in Computer Science, vol. 6078, pp. 13–24. Springer, Berlin (2010)