@misc{Kiwiel_Krzysztof_Improved_2004,
 author={Kiwiel, Krzysztof},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2004},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 abstract={The paper shows that several versions of Floyd and Rivest’s improved algorithm SELECT for finding the kth smallest of n elements require at most n + min\{k, n — k\} +O (n1/2ln1/2n) comparisons on average and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. Encouraging computational results on large median-finding problems are reported.},
 title={Improved Randomized Selection},
 type={Text},
 URL={http://rcin.org.pl/Content/139616/PDF/RB-2004-67.pdf},
 keywords={Medians, Computational complexity, Selection},
}