Resilient quicksort and selection

DOI10.1007/978-3-642-30642-6_2MaRDI QIDQ2907482zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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)

Cited in

(7)

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

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)