Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence (Q659768): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0701288 / rank | |||
Normal rank | |||
Revision as of 16:47, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence |
scientific article |
Statements
Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence (English)
0 references
24 January 2012
0 references
sorting algorithm
0 references
runs
0 references
priority queues
0 references
sock-sorting
0 references
evolution of random strings
0 references
Brownian motion
0 references
