Algorithms – ESA 2005

DOI10.1007/11561071MaRDI QIDQ5475813zbMATH OpenOpenAlexFDO

Authors Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano

Publication date 27 June 2006

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

Full work available at URL https://doi.org/10.1007/11561071

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical problems of computer architecture (68M07) General topics in the theory of algorithms (68W01)

Recommendations

• Designing reliable algorithms in unreliable memories
• Resilient algorithms and data structures
• Sorting and searching in faulty memories
• Sorting and searching in the presence of memory faults (without redundancy)
• Optimal Resilient Sorting and Searching in the Presence of Memory Faults

Cited in

(13)

• The effect of program behavior on fault observability
• Counting in the presence of memory faults
• Local dependency dynamic programming in the presence of memory faults
• Resilient algorithms and data structures
• Dynamic programming in faulty memory hierarchies (cache-obliviously)
• Algorithmic Building Blocks for Asymmetric Memories
• On the inherent resilience of integer operations
• Designing reliable algorithms in unreliable memories
• Fault-tolerance and complexity (extended abstract)
• Resilient dynamic programming
• Reliable computing with unreliable components: Using separable environments to stabilize long-term information storage
• Dependability Aspects Regarding the Cache Level of a Memory Hierarchy using Hamming Codes
• Optimal resilient sorting and searching in the presence of memory faults

This page was built for publication: Algorithms – ESA 2005

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