Ruzicka, Peter Bounds for on-line selection. (English) Zbl 0482.68056 Kybernetika 17, 147-157 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 68P10 Searching and sorting 68Q25 Analysis of algorithms and problem complexity Keywords:selection problem; time complexity; k-th largest element; finite comparison tree; on-line algorithm; asymptotically optimal time bounds PDF BibTeX XML Cite \textit{P. Ruzicka}, Kybernetika 17, 147--157 (1981; Zbl 0482.68056) Full Text: EuDML References: [1] M. Paterson N. Pippenger A. Schonhage: Finding the median. Journal of Computer and System Sciences 13 (1976), 184-199. · Zbl 0335.68033 [2] Chee, Keng Yap: New Lower Bounds for Median and Related Problems. Yale University, Department of Computer Science, Research Report No. 79, 1976. [3] A. V. Aho J. E. Hopcroft J. D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974. · Zbl 0326.68005 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.