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.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: math/0701288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4067869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brownian motion and a sharply curved boundary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum size of a closed epidemic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum of a random walk whose mean path has a maximum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence of operations analysis for dynamic data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analysis of simple list structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability: A Graduate Course / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A functional limit theorem for random graphs with applications to subgraph count statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal decompositions and functional limit theorems for random graph statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional limit theorems for multitype branching processes and generalized Pólya urns. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2774021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum queue size and hashing with lazy deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks, Gaussian processes and list structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large finite population queueing systems part i: the infinite server model. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures' Maxima / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Distribution Theory of Runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random time changes for sock-sorting and other stochastic process limit theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISTRIBUTION OF GROUPS IN A SEQUENCE OF ALTERNATIVES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of hashing with lazy deletion / rank
 
Normal rank

Latest revision as of 21:24, 4 July 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
    0 references
    24 January 2012
    0 references
    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
    0 references
    0 references