On the lower bound for minimum comparison selection

Peter Růžička; Juraj Wiedermann

Aplikace matematiky (1978)

  • Volume: 23, Issue: 1, page 1-8
  • ISSN: 0862-7940

How to cite

top

Růžička, Peter, and Wiedermann, Juraj. "On the lower bound for minimum comparison selection." Aplikace matematiky 23.1 (1978): 1-8. <http://eudml.org/doc/15033>.

@article{Růžička1978,
author = {Růžička, Peter, Wiedermann, Juraj},
journal = {Aplikace matematiky},
keywords = {minimum comparison; selection algorithm; worst-case complexity; lower bound; adversary strategy; selection problem; minimum comparison; selection algorithm; worst-case complexity; lower bound; adversary strategy; selection problem},
language = {eng},
number = {1},
pages = {1-8},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On the lower bound for minimum comparison selection},
url = {http://eudml.org/doc/15033},
volume = {23},
year = {1978},
}

TY - JOUR
AU - Růžička, Peter
AU - Wiedermann, Juraj
TI - On the lower bound for minimum comparison selection
JO - Aplikace matematiky
PY - 1978
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 23
IS - 1
SP - 1
EP - 8
LA - eng
KW - minimum comparison; selection algorithm; worst-case complexity; lower bound; adversary strategy; selection problem; minimum comparison; selection algorithm; worst-case complexity; lower bound; adversary strategy; selection problem
UR - http://eudml.org/doc/15033
ER -

References

top
  1. M. Blum R. W. Floyd V. Pratt R. Rivest R. Tarjan, Time bounds for selection, JCSS 7 (Aug. 1973), 448-461. (1973) MR0329916
  2. L. Hyafil, Bounds for selection, IRIA Rapport de Recherche n° 77. 1974. (1974) MR0464673
  3. D. E. Knuth, The art of computer programming. Volume 3. Sorting and Searching, Addison-Wesley publishing company. 1973. (1973) MR0445948
  4. V. Pratt F. F. Yao, On lower bounds for computing the i-th largest elements, Proceedings of the Fourteenth Symposium on Switching and Automata Theory. 1973. (1973) MR0468319
  5. A. Schönhage M. Paterson N. Pippenger, Finding the median, Theory of Computation Report. The University of Warwick. 1975. (1975) MR0428794

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.