RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskr. Mat., 1994, Volume 6, Issue 1, Pages 83–99 (Mi dm618)  

This article is cited in 3 scientific papers (total in 3 papers)

Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms

V. A. Vatutin


Full text: PDF file (970 kB)

English version:
Discrete Mathematics and Applications, 1994, 4:1, 31–44

Bibliographic databases:
UDC: 519.2
Received: 16.02.1993

Citation: V. A. Vatutin, “Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms”, Diskr. Mat., 6:1 (1994), 83–99; Discrete Math. Appl., 4:1 (1994), 31–44

Citation in format AMSBIB
\Bibitem{Vat94}
\by V.~A.~Vatutin
\paper Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms
\jour Diskr. Mat.
\yr 1994
\vol 6
\issue 1
\pages 83--99
\mathnet{http://mi.mathnet.ru/dm618}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1273235}
\zmath{https://zbmath.org/?q=an:0801.60003}
\transl
\jour Discrete Math. Appl.
\yr 1994
\vol 4
\issue 1
\pages 31--44


Linking options:
  • http://mi.mathnet.ru/eng/dm618
  • http://mi.mathnet.ru/eng/dm/v6/i1/p83

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. D. V. Shuvaev, “Vychislenie raspredeleniya odnoi kombinatornoi statistiki, zadannoi na posledovatelnostyakh s fiksirovannym sostavom znakov”, Matem. vopr. kriptogr., 2:3 (2011), 99–109  mathnet  crossref
    2. Chatterjee S. Diaconis P., “A Central Limit Theorem For a New Statistic on Permutations”, Indian J. Pure Appl. Math., 48:4 (2017), 561–573  crossref  isi
    3. V. A. Vatutin, “Asimptoticheskie svoistva chisla inversii v raskrashennykh derevyakh”, Matem. vopr. kriptogr., 10:4 (2019), 9–24  mathnet  crossref  mathscinet
  • Дискретная математика
    Number of views:
    This page:193
    Full text:96
    First page:3

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020