Optimal Conclusive Sets for Comparator Networks

DOI10.1007/978-3-540-72951-8_24zbMath1201.68046OpenAlexW2174668998MaRDI QIDQ5425979

Tamir Levi, Ami Litman, Guy Even

Publication date: 15 November 2007

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72951-8_24

zbMATH Keywords

sorting networksmerging networkscomparator networkszero-one principlebitonic sorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

Accelerating certain outputs of merging and sorting networks ⋮ On the complexity of min-max sorting networks

This page was built for publication: Optimal Conclusive Sets for Comparator Networks