Sorting and Graphs
- 1 January 1985
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Parallel sortingDiscrete Applied Mathematics, 1983
- Sorting inc logn parallel stepsCombinatorica, 1983
- An adversary-based lower bound for sortingInformation Processing Letters, 1981
- A time-space tradeoff for sorting on non-oblivious machinesJournal of Computer and System Sciences, 1981
- Sorting in one roundIsrael Journal of Mathematics, 1981
- Producing posetsDiscrete Mathematics, 1981
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking NetworksBell System Technical Journal, 1979
- A Counting Approach to Lower Bounds for Selection ProblemsJournal of the ACM, 1979
- Parallelism in tape-sortingCommunications of the ACM, 1974
- Time bounds for selectionJournal of Computer and System Sciences, 1973