A computer-assisted optimal depth lower bound for nine-input sorting networks
Author:
- 1 December 1991
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 24 (1) , 101-116
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Single-exception sorting networks and the computational complexity of optimal sorting network verificationTheory of Computing Systems, 1990
- A computer assisted optimal depth lower bound for sorting networks with nine inputs1989
- Sorting inc logn parallel stepsCombinatorica, 1983
- An 0(n log n) sorting network1983
- Efficient generation of the binary reflected gray code and its applicationsCommunications of the ACM, 1976
- The Bose-Nelson Sorting Problem††The preparation of this report has been supported in part by the National Science Foundation, and in part by the Office of Naval Research.1973
- An Improved Lower Bound for Sorting NetworksIEEE Transactions on Computers, 1972
- Sorting networks and their applications1968
- A Sorting ProblemJournal of the ACM, 1962