A Lower Bound on the Size of Shellsort Sorting Networks
- 1 February 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (1) , 62-71
- https://doi.org/10.1137/0222006
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A new upper bound for ShellsortJournal of Algorithms, 1986
- Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, 1985
- Sorting inc logn parallel stepsCombinatorica, 1983
- A phenomenon in the theory of sortingJournal of Computer and System Sciences, 1972
- An empirical study of minimal storage sortingCommunications of the ACM, 1963
- A high-speed sorting procedureCommunications of the ACM, 1960
- A high-speed sorting procedureCommunications of the ACM, 1959