Pages that link to "Item:Q4268879"
From MaRDI portal
The following pages link to Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults (Q4268879):
Displaying 9 items.
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- Recursive merge sort with erroneous comparisons (Q642963) (← 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)
- Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults (Q1356885) (← links)
- On probabilistic networks for selection, merging, and sorting (Q1384688) (← links)
- Lower bounds for merging networks (Q1854444) (← links)
- Approximate minimum selection with unreliable comparisons (Q2072098) (← links)