Bounds for on-line selection
Kybernetika, Tome 17 (1981) no. 2, pp. 147-157
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{KYB_1981_17_2_a4,
author = {R\r{u}\v{z}i\v{c}ka, Peter},
title = {Bounds for on-line selection},
journal = {Kybernetika},
pages = {147--157},
year = {1981},
volume = {17},
number = {2},
mrnumber = {624207},
zbl = {0482.68056},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1981_17_2_a4/}
}
Růžička, Peter. Bounds for on-line selection. Kybernetika, Tome 17 (1981) no. 2, pp. 147-157. http://geodesic.mathdoc.fr/item/KYB_1981_17_2_a4/
[1] M. Paterson N. Pippenger A. Schonhage: Finding the median. Journal of Computer and System Sciences 13 (1976), 184-199. | MR
[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. | MR