Fault Tolerant Sorting Networks
From MaRDI portal
Publication:3985534
DOI10.1137/0404042zbMath0735.68019OpenAlexW2085891284MaRDI QIDQ3985534
Publication date: 27 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0404042
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorics in computer science (68R05)
Related Items
Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults ⋮ On the design of reliable Boolean circuits that contain partially unreliable gates ⋮ Designing reliable algorithms in unreliable memories ⋮ Sorting by swaps with noisy comparisons ⋮ Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons ⋮ Reliable computations on faulty EREW PRAM ⋮ Resilient dynamic programming ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Sorting and searching in faulty memories ⋮ The price of resiliency: a case study on sorting with memory faults ⋮ Locating Errors in Faulty Formulas ⋮ Optimal resilient sorting and searching in the presence of memory faults
This page was built for publication: Fault Tolerant Sorting Networks
