Optimal Resilient Sorting and Searching in the Presence of Memory Faults

DOI10.1007/11786986_26zbMath1223.68033OpenAlexW2584577692WikidataQ61609592 ScholiaQ61609592MaRDI QIDQ3613767

Giuseppe F. Italiano, Fabrizio Grandoni, Irene Finocchi

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (8)

Fault Tolerant External Memory Algorithms ⋮ Partial sorting problem on evolving data ⋮ Locally Decodable Codes for Edit Distance ⋮ Designing reliable algorithms in unreliable memories ⋮ The solution space of sorting with recurring comparison faults ⋮ Sorting and searching in faulty memories ⋮ The price of resiliency: a case study on sorting with memory faults ⋮ The Solution Space of Sorting with Recurring Comparison Faults

This page was built for publication: Optimal Resilient Sorting and Searching in the Presence of Memory Faults