Increasing and other subsequence problems for random interval sequences
From MaRDI portal
Cites work
- Catalan Numbers
- Concentration of Measure for the Analysis of Randomized Algorithms
- scientific article; zbMATH DE number 3630761 (Why is no real title available?)
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 1515819 (Why is no real title available?)
- scientific article; zbMATH DE number 964350 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- On the distribution of the length of the longest increasing subsequence of random permutations
- On the independence number of random interval graphs
- The surprising mathematics of longest increasing subsequences
This page was built for publication: Increasing and other subsequence problems for random interval sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255812)