A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length

2004/10/04 by F. Thomas Bruss, Freddy Delbaen · 1 citation
Computer Science · Mathematics · #Applied mathematics #Bayesian Methods and Mixture Models #Bounded function #Central limit theorem #Combinatorics #Discrete mathematics #Longest increasing subsequence #Martingale (probability theory) #Mathematical analysis #Mathematics #Monotone polygon #Random Matrices and Applications #Random variable #Sequence (biology) #Statistics #Stochastic processes and statistical mechanics #Subsequence

paper · pdf · doi:10.1016/j.spa.2004.09.002

openalex publication_date 2004/10/04 · crossref created 2004/10/04 · crossref issued 2004/12/01 · crossref published 2004/12/01 · crossref published-print 2004/12/01 · crossref deposited 2019/02/03 · openalex created_date 2025/10/10 · crossref indexed 2026/03/11 · openalex updated_date 2026/08/03

Citations

• On the distribution of the length of the longest increasing subsequence of random permutations
• Optimal rules for the sequential selection of monotone subsequences of maximum expected length
• Optimal Sequential Selection of a Monotone Sequence From a Random Sample
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem

Cited by

• Longest increasing subsequence [wikipedia]