Fault Tolerant Sorting Networks
From MaRDI portal
Recommendations
Cited in
(19)- 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
- Braking the (n^ 2 n) barrier for sorting with faults
- On the design of reliable Boolean circuits that contain partially unreliable gates
- Sorting by swaps with noisy comparisons
- The fault tolerance of \(( n , k )\)-bubble-sort networks
- A generalized fault-tolerant sorting algorithm on product network
- A generalized fault-tolerant sorting algorithm on product network
- A Robust Sorting Network
- On Fault-Tolerant Networks for Sorting
- Fault tolerance in a class of sorting networks
- Designing reliable algorithms in unreliable memories
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
- Locating errors in faulty formulas
- Reliable minimum finding comparator networks
- Resilient dynamic programming
- Searching games with errors -- fifty years of coping with liars
- Reliable computations on faulty EREW PRAM
This page was built for publication: Fault Tolerant Sorting Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985534)