A limit theorem for “quicksort”
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 1, pp. 85-100
Voir la notice de l'article provenant de la source Numdam
@article{ITA_1991__25_1_85_0,
author = {R\"osler, Uwe},
title = {A limit theorem for {\textquotedblleft}quicksort{\textquotedblright}},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {85--100},
publisher = {EDP-Sciences},
volume = {25},
number = {1},
year = {1991},
mrnumber = {1104413},
zbl = {0718.68026},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ITA_1991__25_1_85_0/}
}
TY - JOUR AU - Rösler, Uwe TI - A limit theorem for “quicksort” JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1991 SP - 85 EP - 100 VL - 25 IS - 1 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_1991__25_1_85_0/ LA - en ID - ITA_1991__25_1_85_0 ER -
Rösler, Uwe. A limit theorem for “quicksort”. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 1, pp. 85-100. http://geodesic.mathdoc.fr/item/ITA_1991__25_1_85_0/