Lossless Fault-Tolerant Data Structures with Additive Overhead

DOI10.1007/978-3-642-22300-6_21zbMath1342.68107OpenAlexW1959785497MaRDI QIDQ5199246

Erik D. Demaine, Shaunak Kishore, Paul Christiano

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

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

Related Items (4)

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: Lossless Fault-Tolerant Data Structures with Additive Overhead