Finding the median. (English) Zbl 0335.68033


68Q25 Analysis of algorithms and problem complexity
68W99 Algorithms in computer science
06A05 Total orders
62G30 Order statistics; empirical distribution functions
Full Text: DOI


[1] Blum, M.; Floyd, R.; Pratt, V.; Rivest, R.; Tarjan, R., Time bounds for selection, J. Comput. Systems Sci., 7, 448-461 (1973) · Zbl 0278.68033
[2] Kirkpatrick, D., Topics in the complexity of combinatorial algorithms, (Tech. Report No. 74 (Dec. 1974), Dept. of Comp. Sci., Univ. of Toronto)
[3] Knuth, D., (The Art of Computer Programming, Vol. 3 (1973), Addison-Wesley: Addison-Wesley Reading, Mass.) · Zbl 0302.68010
[4] Pratt, V.; Yao, F., On lower bounds for computing the \(i\) th largest element, (Proc. 14th Ann. IEEE Symp. on Switching and Automata Theory. Proc. 14th Ann. IEEE Symp. on Switching and Automata Theory, Iowa City, Iowa (1973)), 70-81
[5] F. Yao; F. Yao
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.