Sorting and counting networks of arbitrary width and small depth

DOI10.1007/s00224-001-1027-1zbMath0994.68051OpenAlexW2061224182MaRDI QIDQ1601745

Maurice P. Herlihy, Costas Busch

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

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (4)

Self-stabilizing smoothing and balancing networks ⋮ Read-modify-write networks ⋮ An efficient counting network ⋮ Sequentially consistent versus linearizable counting networks

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