A Correction Network for N-Sorters

DOI10.1137/0218078MaRDI QIDQ3034841zbMATH OpenOpenAlexFDO

Authors 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

comparatorsfault toleranceHamming distancereliabilitysorting networks

Mathematics Subject Classification ID

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

Recommendations

• Fibonacci correction networks
• scientific article; zbMATH DE number 871920
• Fast periodic correction networks
• Depth Optimal Sorting Networks Resistant to k Passive Faults
• Algorithms and Computation

Cited in

(7)

• Braking the (n^ 2 n) barrier for sorting with faults
• Fast periodic correction networks
• Faster merging networks with a small constant period
• Fibonacci correction networks
• Fault tolerance in a class of sorting networks
• Algorithms and Computation
• Bitonic sorters of minimal depth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034841)