Sorting and counting networks of arbitrary width and small depth

DOI10.1007/S00224-001-1027-1zbMATH Open0994.68051OpenAlexW2061224182MaRDI QIDQ1601745FDOQ1601745

Authors: Costas Busch, Maurice Herlihy 

Publication date: 27 June 2002

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-001-1027-1

Recommendations

• Improved sorting networks with O(log N) depth
• Optimal-depth sorting networks
• scientific article; zbMATH DE number 1263220
• An efficient counting network
• Optimal sorting networks

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited In (6)

• A pattern theorem for random sorting networks
• Read-modify-write networks
• Sequentially consistent versus linearizable counting networks
• An efficient counting network
• Design and implementation of counting networks
• Self-stabilizing smoothing and balancing networks

This page was built for publication: Sorting and counting networks of arbitrary width and small depth

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