IEEE Transactions on Computers
A Multiway Merge Sorting Network
IEEE Transactions on Parallel and Distributed Systems
The asymptotic complexity of merging networks
Journal of the ACM (JACM)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A generalization of the 0-1 principle for sorting
Information Processing Letters
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Accelerating certain outputs of merging and sorting networks
Theoretical Computer Science
Bitonic sorters of minimal depth
Theoretical Computer Science
| Hi-index | 5.23 |
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.