A Correction Network for N-Sorters

DOI10.1137/0218078zbMath0692.68054OpenAlexW2028006945MaRDI QIDQ3034841

Christoph Starke, Manfred Schimmler

Publication date: 1989

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0218078

zbMATH Keywords

reliabilityfault toleranceHamming distancesorting networkscomparators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithms in computer science (68W99)

Related Items (4)

Fast periodic correction networks ⋮ Faster merging networks with a small constant period ⋮ Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults ⋮ Bitonic sorters of minimal depth

This page was built for publication: A Correction Network for N-Sorters