Diffusion approximations in the online increasing subsequence problem (Q2048141): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Alexander V. Gnedin / rank
Normal rank
 
Property / author
 
Property / author: Alexander V. Gnedin / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114130766 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3168387579 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2001.02249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online selection of a monotone subsequence: a central limit theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive <i>O</i>(log <i>n</i>)‐optimal policy for the online selection of a monotone subsequence from a random sample / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential selection of an increasing sequence from a multidimensional random sample. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal rules for the sequential selection of monotone subsequences of maximum expected length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal selection of stochastic intervals under a sum constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential selection of an increasing subsequence from a sample of random size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sequential selection and a first passage problem for the Poisson process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics and renewal approximation in the online selection of increasing subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest increasing subsequence in a random permutation and a unitary random matrix model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2774021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Processes, Gaussian Processes, and Local Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Surprising Mathematics of Longest Increasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal sequential selection of a monotone sequence from a random sample / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic-Process Limits / rank
 
Normal rank

Latest revision as of 09:03, 26 July 2024

scientific article
Language Label Description Also known as
English
Diffusion approximations in the online increasing subsequence problem
scientific article

    Statements

    Diffusion approximations in the online increasing subsequence problem (English)
    0 references
    0 references
    0 references
    5 August 2021
    0 references
    0 references
    increasing subsequence
    0 references
    online selection strategy
    0 references
    functional limits
    0 references
    0 references
    0 references
    0 references