A Correction Network for N-Sorters

DOI10.1137/0218078zbMATH Open0692.68054OpenAlexW2028006945MaRDI QIDQ3034841FDOQ3034841

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

Recommendations

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

zbMATH Keywords

Hamming distancereliabilityfault tolerancesorting networkscomparators

Mathematics Subject Classification ID

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

Cited In (7)

• Bitonic sorters of minimal depth
• Fault tolerance in a class of sorting networks
• Algorithms and Computation
• Fast periodic correction networks
• Faster merging networks with a small constant period
• Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults
• Title not available (Why is that?)

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)