A computer assisted optimal depth lower bound for sorting networks with nine inputs

Authors:
I. Parberry
Affiliations:
Department of Computer Science, 333 Whitmore Laboratory, The Pennsylvania State University, University Park, Pa.
Venue:
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Year:
1989

Citing 6
Cited 0

Parallel complexity theory

Parallel complexity theory
Sorting in c log n parallel steps

Combinatorica
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 Sorting Problem

Journal of the ACM (JACM)
Efficient generation of the binary reflected gray code and its applications

Communications of the ACM
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is demonstrated that there is no nine-input sorting network of depth six. The proof was obtained by executing on a supercomputer a branch-and-bound algorithm which constructs and tests a critical subset of all possible candidates. Such proofs can be classified as experimental science, rather than mathematics. In keeping with the paradigms of experimental science, a high-level description of the experiment and analysis of the result are given.