Pages that link to "Item:Q3221416"
From MaRDI portal
The following pages link to On Fault-Tolerant Networks for Sorting (Q3221416):
Displaying 14 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)
- On sorting in the presence of erroneous information (Q1199884) (← links)
- Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults (Q1356885) (← links)
- The fault tolerance of \(( n , k )\)-bubble-sort networks (Q2197421) (← links)
- A generalized fault-tolerant sorting algorithm on product network (Q2764894) (← links)
- A Robust Sorting Network (Q3219771) (← links)
- Error-Correcting Tournaments (Q3648756) (← links)
- Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults (Q4268879) (← links)
- Reliable minimum finding comparator networks (Q5096888) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)