Resilient algorithms and data structures

DOI10.1007/978-3-642-13073-1_3MaRDI QIDQ3562988zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Giuseppe F. Italiano

Publication date 28 May 2010

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-13073-1_3

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Data structures (68P05) General topics in the theory of algorithms (68W01)

Recommendations

• Designing reliable algorithms in unreliable memories
• Algorithms – ESA 2005
• Sorting and searching in faulty memories
• Sorting and searching in the presence of memory faults (without redundancy)
• Resilient search trees

Cited in

(11)

• On the error resilience of ordered binary decision diagrams
• Dynamic programming in faulty memory hierarchies (cache-obliviously)
• Local dependency dynamic programming in the presence of memory faults
• Fault Tolerant External Memory Algorithms
• Designing reliable algorithms in unreliable memories
• Resilient dynamic programming
• Data structures resilient to memory faults: an experimental study of dictionaries
• Lossless fault-tolerant data structures with additive overhead
• Algorithms – ESA 2005
• On the inherent resilience of integer operations
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees

This page was built for publication: Resilient algorithms and data structures

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