Reliable minimum finding comparator networks

DOI10.1007/3-540-58338-6_77zbMath1494.68017OpenAlexW3022061027MaRDI QIDQ5096888

Andrzej Pelc, Marek Piotrów, Krzysztof Diks, Piotr Denejko

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_77

Mathematics Subject Classification ID

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

Related Items (1)

Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults

Cites Work

• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Coping with errors in binary search procedures
• On Fault-Tolerant Networks for Sorting

This page was built for publication: Reliable minimum finding comparator networks