Resilient dictionaries

DOI10.1145/1644015.1644016zbMath1300.68020DBLPjournals/talg/FinocchiGI09OpenAlexW2295958421WikidataQ61609535 ScholiaQ61609535MaRDI QIDQ2930274

Giuseppe F. Italiano, Fabrizio Grandoni, Irene Finocchi

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1644015.1644016

zbMATH Keywords

search treesmemory modelsmemory faultssoftware-based fault toleranceunreliable information

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Information storage and retrieval of data (68P20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (5)

Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees ⋮ Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting ⋮ Resilient dynamic programming ⋮ Resilient Dictionaries for Randomly Unreliable Memory ⋮ Exploiting non-constant safe memory in resilient algorithms and data structures

This page was built for publication: Resilient dictionaries