A lower bound for sorting networks based on the shuffle permutation
Authors:
- 1 September 1994
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 27 (5) , 491-508
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Lower Bound on the Size of Shellsort Sorting NetworksSIAM Journal on Computing, 1993
- A hypercubic sorting network with nearly logarithmic depth1992
- Improved lower bounds for Shellsort1992
- Improved sorting networks withO(logN) depthAlgorithmica, 1990
- Interpolation Between Bases and the Shuffle Exchange NetworkEuropean Journal of Combinatorics, 1989
- Rearrangeability of multistage shuffle/exchange networksIEEE Transactions on Communications, 1988
- A unified theory of interconnection network structureTheoretical Computer Science, 1986
- Sorting inc logn parallel stepsCombinatorica, 1983
- Notes on Shuffle/Exchange-Type Switching NetworksIEEE Transactions on Computers, 1980