Pages that link to "Item:Q2820269"
From MaRDI portal
The following pages link to Quickest online selection of an increasing subsequence of specified size (Q2820269):
Displaying 10 items.
- On-line selection of \(c\)-alternating subsequences from a random sample (Q1952478) (← links)
- The BRS-inequality and its applications (Q2039762) (← links)
- Asymptotics and renewal approximation in the online selection of increasing subsequence (Q2040096) (← links)
- Diffusion approximations in the online increasing subsequence problem (Q2048141) (← links)
- On sequential selection and a first passage problem for the Poisson process (Q2064843) (← links)
- Asymptotic expansions and strategies in the online increasing subsequence problem (Q2230576) (← links)
- Sequential selection of a monotone subsequence from a random permutation (Q2821757) (← links)
- Online Selection of Alternating Subsequences from a Random Sample (Q3108479) (← links)
- (Q4558569) (← links)
- An adaptive <i>O</i>(log <i>n</i>)‐optimal policy for the online selection of a monotone subsequence from a random sample (Q4601440) (← links)