An optimal algorithm for parallel selection
- 1 July 1984
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 19 (1) , 47-50
- https://doi.org/10.1016/0020-0190(84)90128-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Lower Bound to Finding Convex HullsJournal of the ACM, 1981
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- Bounds for SelectionSIAM Journal on Computing, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- Very high-speed computing systemsProceedings of the IEEE, 1966