A lower bound on the size of shellsort networks

Authors:
R. Cypher
Affiliations:
Department of Computer Science, FR-35, University of Washington, Seattle, WA
Venue:
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Year:
1989

Improved upper bounds on Shellsort

Journal of Computer and System Sciences
A new upper bound for Shellsort

Journal of Algorithms
Tight bounds on the complexity of parallel sorting

IEEE Transactions on Computers
An empirical study of minimal storage sorting

Communications of the ACM
A high-speed sorting procedure

Communications of the ACM
A high-speed sorting procedure

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

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An analysis of (h,k,l)-shellsort

An analysis of (h,k,l)-shellsort
Shellsort and sorting networks

Shellsort and sorting networks
Lower bounds for shellsort

Lower bounds for shellsort

A lower bound for sorting networks based on the shuffle permutation

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

Hi-index	0.00