Resilient dictionaries

DOI10.1145/1644015.1644016MaRDI QIDQ2930274zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano

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

memory faultsmemory modelssearch treessoftware-based fault toleranceunreliable information

Mathematics Subject Classification ID

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

Recommendations

• Optimal Resilient Dynamic Dictionaries
• Resilient Dictionaries for Randomly Unreliable Memory
• Dictionaries
• scientific article; zbMATH DE number 1952693
• Deterministic dictionaries
• scientific article; zbMATH DE number 2040862
• Data structures resilient to memory faults: an experimental study of dictionaries
• scientific article; zbMATH DE number 1875424

Cited in

(12)

• Exploiting non-constant safe memory in resilient algorithms and data structures
• Resilient search trees
• Optimal Resilient Dynamic Dictionaries
• Priority Queues Resilient to Memory Faults
• Selection in the presence of memory faults, with applications to in-place resilient sorting
• Resilient Dictionaries for Randomly Unreliable Memory
• Resilient dynamic programming
• Data structures resilient to memory faults: an experimental study of dictionaries
• Lossless fault-tolerant data structures with additive overhead
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
• Approximate selection with unreliable comparisons in sublinear time
• Dictionaries

This page was built for publication: Resilient dictionaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930274)