scientific article; zbMATH DE number 871920

MaRDI QIDQ4875191zbMATH OpenFDO

Authors Marek Piotrów

Publication date 11 December 1996

zbMATH Keywords

sorting networkcircuit switchingpacket routing

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Recommendations

• Depth Optimal Sorting Networks Resistant to k Passive Faults
• scientific article; zbMATH DE number 1256743
• Braking the (n^ 2 n) barrier for sorting with faults
• scientific article; zbMATH DE number 1617286

Cited in

(12)

• Reliable minimum finding comparator networks
• A Correction Network for N-Sorters
• Fault tolerance in a class of sorting networks
• Searching games with errors -- fifty years of coping with liars
• Fast periodic correction networks
• Depth Optimal Sorting Networks Resistant to k Passive Faults
• A generalized fault-tolerant sorting algorithm on product network
• The solution space of sorting with recurring comparison faults
• Algorithms and Computation
• On Fault-Tolerant Networks for Sorting
• scientific article; zbMATH DE number 1617286 (Why is no real title available?)
• Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults

This page was built for publication:

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