Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: extended abstract.

zbMATH Open1192.68197MaRDI QIDQ3576767FDOQ3576767

Authors: Svante Janson 

Publication date: 2 August 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAH0117/0.html

Recommendations

• Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
• Random time changes for sock-sorting and other stochastic process limit theorems
• The number of readings of non-equiprobable files under stable sorting
• Almost-sure asymptotics for the number of heaps inside a random sequence
• scientific article; zbMATH DE number 841603

zbMATH Keywords

Brownian motionrunspriority queuessorting algorithmevolution of random stringssock-sorting

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Computer aspects of numerical algorithms (65Yxx)

Cited In (1)

• Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence

This page was built for publication: Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: extended abstract.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576767)