Pages that link to "Item:Q1356885"
From MaRDI portal
The following pages link to Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults (Q1356885):
Displaying 8 items.
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- Resilient dynamic programming (Q513272) (← links)
- Recursive merge sort with erroneous comparisons (Q642963) (← links)
- The solution space of sorting with recurring comparison faults (Q726101) (← links)
- Sorting and searching in faulty memories (Q1006385) (← links)
- The price of resiliency: a case study on sorting with memory faults (Q1016529) (← links)
- Optimal resilient sorting and searching in the presence of memory faults (Q1035681) (← links)
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm (Q1040789) (← links)