Optimal Conclusive Sets for Comparator Networks

DOI10.1007/978-3-540-72951-8_24MaRDI QIDQ5425979zbMATH OpenOpenAlexFDO

Authors Guy Even, Tamir Levi, Ami Litman

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)

Recommendations

• Optimal conclusive sets for comparator networks
• Bounds on the size of test sets for sorting and related networks
• Lower bounds for merging networks
• Mathematical Foundations of Computer Science 2003
• Better understanding of Batcher's merging networks

Cited in

(4)

• On the complexity of min-max sorting networks
• Optimal conclusive sets for comparator networks
• scientific article; zbMATH DE number 1515321 (Why is no real title available?)
• Accelerating certain outputs of merging and sorting networks

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

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