Lossless fault-tolerant data structures with additive overhead

DOI10.1007/978-3-642-22300-6_21MaRDI QIDQ5199246zbMATH OpenOpenAlexFDO

Authors Paul Christiano, Erik D. Demaine, Shaunak Kishore

Publication date 12 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22300-6_21

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Data structures (68P05)

Recommendations

• Resilient search trees
• Optimal Resilient Dynamic Dictionaries
• Resilient dictionaries
• Data structures resilient to memory faults: an experimental study of dictionaries
• Resilient algorithms and data structures

Cited in

(12)

• A general approach to the identification of compensated faults in robust data structures
• Exploiting non-constant safe memory in resilient algorithms and data structures
• Resilient search trees
• Optimal Resilient Dynamic Dictionaries
• Indexing Information for Data Forensics
• scientific article; zbMATH DE number 4113964 (Why is no real title available?)
• 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
• Error-correcting data structures
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees

This page was built for publication: Lossless fault-tolerant data structures with additive overhead

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