A Lower Bound for Sorting Networks Based on the Shuffle Permutation

Authors:
C. G Plaxton;Torsten Suel
Affiliations:
-;-
Venue:
A Lower Bound for Sorting Networks Based on the Shuffle Permutation
Year:
1992

Citing 0
Cited 1

A hypercubic sorting network with nearly logarithmic depth

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove an omega (lg2 n/lg lg n) lower bound for the depth of sorting networks based on the shuffle permutation. This settles an open question posed by Knuth, up to a theta (lg lg n) factor. The proof technique employed in the lower bound argument may be of separate interest.