Fault Tolerant External Memory Algorithms
From MaRDI portal
Publication:3183472
DOI10.1007/978-3-642-03367-4_36zbMath1253.68351OpenAlexW1533453060MaRDI QIDQ3183472
Gerth Stølting Brodal, Thomas Mølhave, Allan Grønlund Jørgensen
Publication date: 20 October 2009
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-03367-4_36
Related Items (2)
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting ⋮ Resilient dynamic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Designing reliable algorithms in unreliable memories
- Organization and maintenance of large ordered indexes
- Algorithms and Data Structures for External Memory
- Algorithm-Based Fault Tolerance for Matrix Operations
- Optimal Resilient Dynamic Dictionaries
- Sorting and searching in the presence of memory faults (without redundancy)
- Priority Queues Resilient to Memory Faults
- Optimal Resilient Sorting and Searching in the Presence of Memory Faults
- An Approach to Concurrent Control Flow Checking
- The Price of Resiliency: A Case Study on Sorting with Memory Faults
This page was built for publication: Fault Tolerant External Memory Algorithms