Sorting Networks of Logarithmic Depth, Further Simplified
Author:
- 28 September 2007
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 53 (3) , 374-384
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Construction of halversInformation Processing Letters, 1999
- The Design and Analysis of Parallel Algorithms1993
- Halvers and expanders (switching)1992
- Introduction to AlgorithmsJournal of the Operational Research Society, 1991
- Improved sorting networks withO(logN) depthAlgorithmica, 1990
- Communication Networks1990
- Sorting inc logn parallel stepsCombinatorica, 1983
- An 0(n log n) sorting network1983
- Sorting algorithms with minimum memoryCybernetics and Systems Analysis, 1969
- Sorting networks and their applications1968