Time bounds for selection. (English) Zbl 0278.68033


68W99 Algorithms in computer science
68N01 General topics in the theory of software
68Q25 Analysis of algorithms and problem complexity


Full Text: DOI


[1] (The Complete Works of Lewis Carroll (1947), New York Modern Library)
[2] Ford, L. R.; Johnson, S. M., A tournament problem, The American Mathematical Montly, 66, 387-389 (May 1959) · Zbl 0092.01303
[3] Abdollah, Hadian, Optimality properties of various procedures for ranking \(n\) different numbers using only binary comparisons, (Technical Report 117 (May 1969), Dept. of Statistics, Univ. of Minnesota), Ph.D. thesis · Zbl 0221.05019
[4] Hadian, Abdollah; Sobel, Milton, Selecting the \(t\)-th largest using binary errorless comparisons, (Technical Report 121 (May 1969), Dept. of Statistics, Univ. of Minnesota) · Zbl 0221.05019
[5] Hoare, C. A.R., Find (Algorithm 65), Communications of the ACM, 321-322 (July 1961)
[6] Kislitsin, S. S., On the selection of the \(k\)-th element of an ordered set by pairwise comparisons, Sibirsk Math. Z., 5, 557-564 (1964), (MR 29, No. 2198) (Russian)
[7] Knuth, Donald E., (The Art of Computer Programming (Vol. III, Sorting and Searching (1973), Addison-Wesley) · Zbl 0302.68010
[8] Jósef, Schreier, O systemach eliminacjii w turniejach, Mathesis Polska, 7, 154-160 (1932), (Polish)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.