Geodesic
Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms
Diskretnaya Matematika, Tome 6 (1994) no. 1, pp. 83-99
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DM_1994_6_1_a5,
     author = {V. A. Vatutin},
     title = {Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms},
     journal = {Diskretnaya Matematika},
     pages = {83--99},
     year = {1994},
     volume = {6},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1994_6_1_a5/}
}
TY  - JOUR
AU  - V. A. Vatutin
TI  - Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms
JO  - Diskretnaya Matematika
PY  - 1994
SP  - 83
EP  - 99
VL  - 6
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DM_1994_6_1_a5/
LA  - ru
ID  - DM_1994_6_1_a5
ER  - 
%0 Journal Article
%A V. A. Vatutin
%T Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms
%J Diskretnaya Matematika
%D 1994
%P 83-99
%V 6
%N 1
%U http://geodesic.mathdoc.fr/item/DM_1994_6_1_a5/
%G ru
%F DM_1994_6_1_a5
V. A. Vatutin. Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms. Diskretnaya Matematika, Tome 6 (1994) no. 1, pp. 83-99. http://geodesic.mathdoc.fr/item/DM_1994_6_1_a5/