Resilient quicksort and selection

DOI10.1007/978-3-642-30642-6_2zbMATH Open1360.68390OpenAlexW1896434028MaRDI QIDQ2907482FDOQ2907482

Authors: Ivan Pouzyrevsky, Maxim Babenko 

Publication date: 10 September 2012

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30642-6_2

Recommendations

• 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
• Optimal Resilient Sorting and Searching in the Presence of Memory Faults
• Sorting and searching in the presence of memory faults (without redundancy)

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Searching and sorting (68P10)

Cited In (7)

• Selection in the presence of memory faults, with applications to in-place resilient sorting
• Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures
• Optimal sampling strategies in Quicksort and Quickselect
• Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
• On quickselect, partial sorting and multiple Quickselect
• Sorting and searching in faulty memories
• Resilient dynamic programming

This page was built for publication: Resilient quicksort and selection

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