A Counting Approach to Lower Bounds for Selection Problems
- 1 April 1979
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 26 (2) , 227-238
- https://doi.org/10.1145/322123.322128
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Finding the medianJournal of Computer and System Sciences, 1976
- Bounds for SelectionSIAM Journal on Computing, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Proving simultaneous positivity of linear formsJournal of Computer and System Sciences, 1972
- On the Optimality of Some Set AlgorithmsJournal of the ACM, 1972
- Complete linear proofs of systems of linear inequalitiesJournal of Computer and System Sciences, 1972
- A sorting problem and its complexityCommunications of the ACM, 1972