Optimal conclusive sets for comparator networks

Guy Even, Tamir Levi*, Ami Litman

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A set of input vectors S is conclusive for a certain functionality if, for every comparator network, correct functionality for all input vectors is implied by correct functionality for all vectors in S. We consider four functionalities of comparator networks: sorting, merging, sorting of bitonic vectors, and halving. For each of these functionalities, we present two conclusive sets of minimal cardinality. The members of the first set are restricted to be binary, while the members of the second set are unrestricted. For all the above functionalities, except halving, the unrestricted conclusive set is much smaller than the binary one.

Original languageEnglish
Pages (from-to)1369-1376
Number of pages8
JournalTheoretical Computer Science
Volume410
Issue number14
DOIs
StatePublished - 28 Mar 2009

Keywords

  • Bitonic sorting
  • Comparator networks
  • Merging networks
  • Sorting networks
  • Zero-one Principle

Fingerprint

Dive into the research topics of 'Optimal conclusive sets for comparator networks'. Together they form a unique fingerprint.

Cite this