A Unified Lower Bound for Selection and Set Partitioning Problems
- 1 January 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 28 (1) , 150-165
- https://doi.org/10.1145/322234.322245
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- A Counting Approach to Lower Bounds for Selection ProblemsJournal of the ACM, 1979
- Finding the medianJournal of Computer and System Sciences, 1976
- New upper bounds for selectionCommunications of the ACM, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973