Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays

DOI10.1017/S0963548314000637zbMath1371.60031OpenAlexW1972324485MaRDI QIDQ5364222

Jose A. Soto, Marcos A. Kiwi

Publication date: 4 October 2017

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

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

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial probability (60C05)

Related Items (1)

The BRS-inequality and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length
• Optimal sequential selection of a monotone sequence from a random sample
• The height of a random partial order: Concentration of measure
• Increasing sequences of independent points on the planar lattice
• Sequential selection of an increasing sequence from a multidimensional random sample.
• Optimal rules for the sequential selection of monotone subsequences of maximum expected length
• A concentration bound for the longest increasing subsequence of a randomly chosen involution
• Expected length of the longest common subsequence for large alphabets
• Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence
• Online Selection of Alternating Subsequences from a Random Sample
• A Knapsack Secretary Problem with Applications
• The Longest Chain Among Random Points in Euclidean Space
• ‘Wald's Lemma' for sums of order statistics of i.i.d. random variables
• A note on the selection of random variables under a sum constraint
• Longest common subsequences of two random sequences
• Smallest-fit selection of random sizes under a sum constraint: weak convergence and moment comparisons
• On the distribution of the length of the longest increasing subsequence of random permutations
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Optimal selection of stochastic intervals under a sum constraint
• Recent progress in algebraic combinatorics
• A Note on Sequential Selection from Permutations
• Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem

This page was built for publication: Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays