The following pages link to Fault Tolerant Sorting Networks (Q3985534):
Displaying 12 items.
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- Resilient dynamic programming (Q513272) (← links)
- Reliable computations on faulty EREW PRAM (Q671425) (← 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 the design of reliable Boolean circuits that contain partially unreliable gates (Q1384528) (← links)
- Sorting by swaps with noisy comparisons (Q1725654) (← links)
- Locating Errors in Faulty Formulas (Q4972679) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
