zbMATH — the first resource for mathematics

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] Lewis, Carroll, (), 5-6, Reprinted
[2] Ford, L.R.; Johnson, S.M., A tournament problem, The American mathematical montly, 66, 387-389, (May 1959)
[3] Abdollah, Hadian, Optimality properties of various procedures for ranking n different numbers using only binary comparisons, (), Ph.D. thesis · Zbl 0221.05019
[4] Hadian, Abdollah; Sobel, Milton, Selecting the t-th largest using binary errorless comparisons, () · 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., ()
[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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.