Sorting and searching in faulty memories
From MaRDI portal
Publication:1006385
DOI10.1007/s00453-007-9088-4zbMath1163.68319DBLPjournals/algorithmica/FinocchiI08OpenAlexW2002214793WikidataQ61609554 ScholiaQ61609554MaRDI QIDQ1006385
Giuseppe F. Italiano, Irene Finocchi
Publication date: 24 March 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9088-4
SearchingSortingCombinatorial algorithmsComputing with unreliable informationMemory faultsMemory models
Related Items (7)
Energy efficient sorting, selection and searching ⋮ Recursive merge sort with erroneous comparisons ⋮ Resilient dynamic programming ⋮ Resilient Dictionaries for Randomly Unreliable Memory ⋮ 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
Uses Software
Cites Work
- 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
- Sorting and searching in the presence of memory faults (without redundancy)
- 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
- Computer Aided Verification
- Searching games with errors -- fifty years of coping with liars
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sorting and searching in faulty memories
