@inproceedings{a23fe1151baf4dabbc7cb0cec94dbae7,

title = "Optimal conclusive sets for comparator networks",

abstract = "A set of input vectors S is conclusive if correct functionality for all input vectors is implied by correct functionality over vectors in S. We consider four functionalities of comparator networks: sorting, merging of two equal length sorted vectors, sorting of bitonic vectors, and halving (i.e., separating values above and below the median). For each of these functionalities, we present tight lower and upper bounds on the size of conclusive sets. Bounds are given both for conclusive sets composed of binary vectors and of general vectors. The bounds for general vectors are smaller than the bounds for binary vectors implied by the 0-1 principle. Our results hold also for comparator networks with unbounded fanout. Assume the network at hand has n inputs and outputs, where n is even. We present a conclusive set for sorting that contains (n/2n) nonbinary vectors. For merging, we present a conclusive set with n/2 + 1 nonbinary vectors. For bitonic sorting, we present a conclusive set with n nonbinary vectors. For halving, we present ( n/2n) binary vectors that constitute a conclusive set. We prove that all these conclusive sets are optimal.",

keywords = "Bitonic sorting, Comparator networks, Merging networks, Sorting networks, Zero-one principle",

author = "Guy Even and Tamir Levi and Ami Litman",

year = "2007",

doi = "10.1007/978-3-540-72951-8_24",

language = "אנגלית",

isbn = "9783540729181",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "304--317",

booktitle = "Structural Information and Communication Complexity - 14th International Colloquium, SIROCCO 2007, Proceedings",

note = "null ; Conference date: 05-06-2007 Through 08-06-2007",

}