Sorting Using Complete Subintervals and the Maximum Number of Runs in a Randomly Evolving Sequence
Author:
- 31 March 2009
- journal article
- research article
- Published by Springer Nature in Annals of Combinatorics
- Vol. 12 (4) , 417-447
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Foundations of Modern Probability2002
- The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibresAdvances in Applied Probability, 1989
- Brownian motion with a parabolic drift and airy functionsProbability Theory and Related Fields, 1989
- Limit Theorems for Stochastic Processes1987
- The analysis of simple list structuresInformation Sciences, 1986
- The maximum of a random walk whose mean path has a maximumAdvances in Applied Probability, 1985
- Brownian motion and a sharply curved boundaryAdvances in Applied Probability, 1981
- Sequence of operations analysis for dynamic data structuresJournal of Algorithms, 1980
- The maximum size of a closed epidemicAdvances in Applied Probability, 1974
- DISTRIBUTION OF GROUPS IN A SEQUENCE OF ALTERNATIVESAnnals of Eugenics, 1939