Slowing down sorting networks to obtain faster sorting algorithms
- 1 January 1987
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 34 (1), 200-208
- https://doi.org/10.1145/7531.7537
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On k-Hulls and Related ProblemsSIAM Journal on Computing, 1987
- Partitioning with two lines in the planeJournal of Algorithms, 1985
- A parallel median algorithmInformation Processing Letters, 1985
- New Results on the Complexity of p-Centre ProblemsSIAM Journal on Computing, 1983
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- Sorting inc logn parallel stepsCombinatorica, 1983
- Explicit constructions of linear-sized superconcentratorsJournal of Computer and System Sciences, 1981
- Combinatorial Optimization with Rational Objective FunctionsMathematics of Operations Research, 1979
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- A linear selection algorithm for sets of elements with weightsInformation Processing Letters, 1978