@misc{Kiwiel_Krzysztof_Randomized_2002,
 author={Kiwiel, Krzysztof},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2002},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 abstract={It is shown that several versions of Floyd and Rivest’s algorithm Select for finding the kth smallest of n elements require at most n+min\{k, n-k\} + o(n) comparisons on aveage, even when equal elements occur. This parallels recent analysis of another variant due to Floyd and Rivest.The computational results suggest that both variants perform well in practice, and may compete with other selection methods, such as Hoare’s Find or quickselect with median-of-three partitioning.},
 title={Randomized Selection with Tripartitioning},
 type={Text},
 URL={http://rcin.org.pl/Content/139424/PDF/RB-2002-80.pdf},
 keywords={Medians, Computational complexity, Partitioning, Selection, Selekcja, Mediany, Partycjonowanie, Złożoność obliczeniowa},
}