A Note on Sequential Selection from Permutations

DOI10.1017/S0963548399004149MaRDI QIDQ4948042zbMATH OpenOpenAlexFDO

Authors Alexander Gnedin

Publication date 5 September 2000

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548399004149

zbMATH Keywords

permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Recommendations

• Sequential selection of a monotone subsequence from a random permutation
• On increasing subsequences of random permutations
• scientific article; zbMATH DE number 1047715
• On the distribution of the length of the longest increasing subsequence in a random permutation
• On the distribution of the length of the longest increasing subsequence of random permutations

Cited in

(10)

• Monotonic subsequences in permutations of n natural numbers
• Sequential selection of an increasing sequence from a multidimensional random sample.
• Optimal rules for the sequential selection of monotone subsequences of maximum expected length
• Asymptotics and renewal approximation in the online selection of increasing subsequence
• Sequential selection of a monotone subsequence from a random permutation
• A note on a permutation invariant sequential selection procedure
• scientific article; zbMATH DE number 4008477 (Why is no real title available?)
• Optimal online selection of an alternating subsequence: a central limit theorem
• Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
• The sequence selection properties of C_p(X)

This page was built for publication: A Note on Sequential Selection from Permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948042)