Pages that link to "Item:Q1176972"
From MaRDI portal
The following pages link to On the length of the longest monotone subsequence in a random permutation (Q1176972):
Displaying 15 items.
- A direct verification argument for the Hamilton-Jacobi equation continuum limit of nondominated sorting (Q299237) (← links)
- Noncommutative martingale concentration inequalities (Q491470) (← links)
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- Random partial orders defined by angular domains (Q634753) (← links)
- Random \(k\)-dimensional orders: Width and number of linear extensions (Q687172) (← links)
- Hammersley's interacting particle process and longest increasing subsequences (Q1900235) (← links)
- Concentration of measure and isoperimetric inequalities in product spaces (Q1908323) (← links)
- A concentration bound for the longest increasing subsequence of a randomly chosen involution (Q2500530) (← links)
- Expected length of the longest common subsequence for large alphabets (Q2573406) (← links)
- Longest convex chains (Q3055769) (← links)
- Arithmetic subsequences in a random ordering of an additive set (Q3390062) (← links)
- A sharp concentration inequality with applications (Q4487095) (← links)
- Connect the dots: how many random points can a regular curve pass through? (Q5697192) (← links)
- Decomposing Random Permutations into Order-Isomorphic Subpermutations (Q6161260) (← links)
- Locally uniform random permutations with large increasing subsequences (Q6204686) (← links)
