Sorting and searching in the presence of memory faults (without redundancy)

DOI10.1145/1007352.1007375zbMATH Open1192.68958OpenAlexW2084951252MaRDI QIDQ3580962FDOQ3580962

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

Recommendations

• Optimal Resilient Sorting and Searching in the Presence of Memory Faults
• Optimal resilient sorting and searching in the presence of memory faults
• Selection in the presence of memory faults, with applications to in-place resilient sorting
• The price of resiliency: a case study on sorting with memory faults
• The Price of Resiliency: A Case Study on Sorting with Memory Faults
• Large-scale sorting in uniform memory hierarchies
• Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
• Cache-oblivious and data-oblivious sorting and applications
• The solution space of sorting with recurring comparison faults
• The solution space of sorting with recurring comparison faults

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) General topics in the theory of algorithms (68W01)

Cited In (15)

• Selection from read-only memory and sorting with minimum data movement
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
• Optimal Resilient Sorting and Searching in the Presence of Memory Faults
• Locally Decodable Codes for Edit Distance
• Fault Tolerant External Memory Algorithms
• The Price of Resiliency: A Case Study on Sorting with Memory Faults
• Designing reliable algorithms in unreliable memories
• Partial sorting problem on evolving data
• Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting
• Algorithms – ESA 2005
• Searching a Tree with Permanently Noisy Advice
• Memory-Efficient Algorithms for Finding Needles in Haystacks
• Sorting and searching in faulty memories
• The price of resiliency: a case study on sorting with memory faults
• Optimal resilient sorting and searching in the presence of memory faults

Uses Software

• STL

This page was built for publication: Sorting and searching in the presence of memory faults (without redundancy)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580962)