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

DOI10.1145/1007352.1007375MaRDI QIDQ3580962zbMATH OpenOpenAlexFDO

Authors Irene Finocchi, Giuseppe F. Italiano

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

Mathematics Subject Classification ID

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

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

Cited in

(19)

• The query complexity of searching trees with permanently noisy advice
• Selection from read-only memory and sorting with minimum data movement
• Locally decodable codes for edit distance
• Resilient quicksort and selection
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
• Selection in the presence of memory faults, with applications to in-place resilient sorting
• Optimal Resilient Sorting and Searching in the Presence of Memory Faults
• Resilient algorithms and data structures
• Exploiting non-constant safe memory in resilient algorithms and data structures
• Fault Tolerant External Memory Algorithms
• Designing reliable algorithms in unreliable memories
• The Price of Resiliency: A Case Study on Sorting with Memory Faults
• Partial sorting problem on evolving data
• 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

Describes a project that uses

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)