Designing reliable algorithms in unreliable memories
From MaRDI portal
Publication:458451
DOI10.1016/j.cosrev.2007.10.001zbMath1302.68106OpenAlexW2140026235WikidataQ61609562 ScholiaQ61609562MaRDI QIDQ458451
Irene Finocchi, Giuseppe F. Italiano, Fabrizio Grandoni
Publication date: 7 October 2014
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cosrev.2007.10.001
Searching and sorting (68P10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)
Related Items (5)
Fault Tolerant External Memory Algorithms ⋮ Recursive merge sort with erroneous comparisons ⋮ The price of resiliency: a case study on sorting with memory faults ⋮ Exploiting non-constant safe memory in resilient algorithms and data structures ⋮ On the error resilience of ordered binary decision diagrams
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Checking the correctness of memories
- Searching with known error probability
- Coping with errors in binary search procedures
- Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults
- On Fault-Tolerant Networks for Sorting
- Optimal Resilient Dynamic Dictionaries
- Cache-oblivious priority queue and graph algorithm applications
- 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
- Fault Tolerant Sorting Networks
- Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
- Computing with Noisy Information
- On word-level parallelism in fault-tolerant computing
- Comparison-based search in the presence of errors
- The Price of Resiliency: A Case Study on Sorting with Memory Faults
- Automata, Languages and Programming
- Computer Aided Verification
- Searching games with errors -- fifty years of coping with liars
This page was built for publication: Designing reliable algorithms in unreliable memories
