Optimal Conclusive Sets for Comparator Networks

DOI10.1007/978-3-540-72951-8_24zbMATH Open1201.68046OpenAlexW2174668998MaRDI QIDQ5425979FDOQ5425979

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

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

zbMATH Keywords

sorting networksmerging networkscomparator networkszero-one principlebitonic sorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited In (5)

• Comparator circuits over finite bounded posets
• On the complexity of min-max sorting networks
• Title not available (Why is that?)
• Optimal conclusive sets for comparator networks
• 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)