A fault-tolerant merge sorting algorithm
From MaRDI portal
Recommendations
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
- Braking the (n^ 2 n) barrier for sorting with faults
- The solution space of sorting with recurring comparison faults
- Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
- The solution space of sorting with recurring comparison faults
Cited in
(11)- 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
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
- On sorting in the presence of erroneous information
- A tree-based mergesort
- The solution space of sorting with recurring comparison faults
- Designing reliable algorithms in unreliable memories
- scientific article; zbMATH DE number 2147931 (Why is no real title available?)
- Recursive merge sort with erroneous comparisons
- The solution space of sorting with recurring comparison faults
This page was built for publication: A fault-tolerant merge sorting algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808665)