Finding the ?n-th largest element
- 1 March 1996
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 16 (1) , 41-58
- https://doi.org/10.1007/bf01300126
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Average case selectionJournal of the ACM, 1989
- A New Lower Bound for the Set-Partitioning ProblemSIAM Journal on Computing, 1988
- Finding the median requires 2n comparisonsPublished by Association for Computing Machinery (ACM) ,1985
- New algorithms for selectionJournal of Algorithms, 1984
- A note on upper bounds for the selection problemInformation Processing Letters, 1982
- Finding the medianJournal of Computer and System Sciences, 1976
- New upper bounds for selectionCommunications of the ACM, 1976
- Expected time bounds for selectionCommunications of the ACM, 1975
- Time bounds for selectionJournal of Computer and System Sciences, 1973