Exponential bounds for the running time of a selection algorithm
- 31 August 1984
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 29 (1) , 1-7
- https://doi.org/10.1016/0022-0000(84)90009-6
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Finding the medianJournal of Computer and System Sciences, 1976
- Expected time bounds for selectionCommunications of the ACM, 1975
- Algorithm 489: the algorithm SELECT—for finding the i th smallest of n elements [M1]Communications of the ACM, 1975
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- Algorithm 64: QuicksortCommunications of the ACM, 1961
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952