A lower bound for sorting networks based on the shuffle permutation
- 1 September 1994
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 27 (5), 491-508
- https://doi.org/10.1007/bf01184936
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A (fairly) simple circuit that (usually) sortsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Lower Bound on the Size of Shellsort Sorting NetworksSIAM Journal on Computing, 1993
- A hypercubic sorting network with nearly logarithmic depthPublished by Association for Computing Machinery (ACM) ,1992
- Improved lower bounds for ShellsortPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- 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