scientific article; zbMATH DE number 871920

zbMATH Open0852.68005MaRDI QIDQ4875191FDOQ4875191

Authors: Marek Piotrów 

Publication date: 11 December 1996

Title of this publication is not available (Why is that?)

Recommendations

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

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)

Cited In (12)

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

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)