Sorting and searching in the presence of memory faults (without redundancy)
From MaRDI portal
Publication:3580962
DOI10.1145/1007352.1007375zbMath1192.68958OpenAlexW2084951252MaRDI QIDQ3580962
Giuseppe F. Italiano, Irene Finocchi
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007375
Analysis of algorithms (68W40) Searching and sorting (68P10) General topics in the theory of algorithms (68W01)
Related Items (9)
Fault Tolerant External Memory Algorithms ⋮ Partial sorting problem on evolving data ⋮ Locally Decodable Codes for Edit Distance ⋮ Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees ⋮ Designing reliable algorithms in unreliable memories ⋮ Searching a Tree with Permanently Noisy Advice ⋮ Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting ⋮ Sorting and searching in faulty memories ⋮ Optimal resilient sorting and searching in the presence of memory faults
Uses Software
This page was built for publication: Sorting and searching in the presence of memory faults (without redundancy)
