Resilient quicksort and selection
From MaRDI portal
Publication:2907482
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)- 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)