Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1515819
- scientific article; zbMATH DE number 1047715
- Longest increasing subsequences in pattern-restricted permutations
- Longest increasing subsequences of random colored permutations
- scientific article; zbMATH DE number 3860389
- Longest increasing subsequences in sliding windows
- Enumerating longest increasing subsequences and patience sorting
- Fast computation of a longest increasing subsequence and application
- The longest almost-increasing subsequence
- The Longest Almost-Increasing Subsequence
Cites work
- ‘Wald's Lemma' for sums of order statistics of i.i.d. random variables
- A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length
- A concentration bound for the longest increasing subsequence of a randomly chosen involution
- A Knapsack Secretary Problem with Applications
- A Note on Sequential Selection from Permutations
- A note on the selection of random variables under a sum constraint
- Expected length of the longest common subsequence for large alphabets
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3383344 (Why is no real title available?)
- Increasing sequences of independent points on the planar lattice
- Longest common subsequences of two random sequences
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Matroids, secretary problems, and online mechanisms
- On the distribution of the length of the longest increasing subsequence of random permutations
- Online Selection of Alternating Subsequences from a Random Sample
- Optimal online selection of an alternating subsequence: a central limit theorem
- Optimal rules for the sequential selection of monotone subsequences of maximum expected length
- Optimal selection of stochastic intervals under a sum constraint
- Optimal sequential selection of a monotone sequence from a random sample
- Optimal sequential selection of a unimodal subsequence of a random sequence
- Recent progress in algebraic combinatorics
- Sequential selection of an increasing sequence from a multidimensional random sample.
- Smallest-fit selection of random sizes under a sum constraint: weak convergence and moment comparisons
- Symmetrized random permutations
- The height of a random partial order: Concentration of measure
- The Longest Chain Among Random Points in Euclidean Space
Cited in
(2)
This page was built for publication: Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364222)
