Bounds for on-line selection
Kybernetika (1981)
- Volume: 17, Issue: 2, page 147-157
- ISSN: 0023-5954
Access Full Article
top
How to cite
topRůžička, Peter. "Bounds for on-line selection." Kybernetika 17.2 (1981): 147-157. <http://eudml.org/doc/27920>.
@article{Růžička1981,
author = {Růžička, Peter},
journal = {Kybernetika},
keywords = {selection problem; time complexity; k-th largest element; finite comparison tree; on-line algorithm; asymptotically optimal time bounds},
language = {eng},
number = {2},
pages = {147-157},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Bounds for on-line selection},
url = {http://eudml.org/doc/27920},
volume = {17},
year = {1981},
}
TY - JOUR
AU - Růžička, Peter
TI - Bounds for on-line selection
JO - Kybernetika
PY - 1981
PB - Institute of Information Theory and Automation AS CR
VL - 17
IS - 2
SP - 147
EP - 157
LA - eng
KW - selection problem; time complexity; k-th largest element; finite comparison tree; on-line algorithm; asymptotically optimal time bounds
UR - http://eudml.org/doc/27920
ER -
References
top- M. Paterson N. Pippenger A. Schonhage, Finding the median, Journal of Computer and System Sciences 13 (1976), 184-199. (1976) MR0428794
- Chee, Keng Yap, New Lower Bounds for Median and Related Problems, Yale University, Department of Computer Science, Research Report No. 79, 1976. (1976)
- A. V. Aho J. E. Hopcroft J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, 1974. (1974) MR0413592
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.