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

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

Diskretnaya Matematika, 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 (970 kB) Citations (3)
Received: 16.02.1993
Bibliographic databases:
Document Type: Article
UDC: 519.2
Language: Russian
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://mathscinet.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:
  • https://www.mathnet.ru/eng/dm618
  • https://www.mathnet.ru/eng/dm/v6/i1/p83
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:300
    Full-text PDF :118
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024