Fast and longest rollercoasters
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5729471 (Why is no real title available?)
- scientific article; zbMATH DE number 795114 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A fast algorithm for computing longest common subsequences
- Applications of generalized matrix searching to geometric algorithms
- Enumerating longest increasing subsequences and patience sorting
- Fast computation of a longest increasing subsequence and application
- Fast distance multiplication of unit-Monge matrices
- Geometric applications of a matrix-searching algorithm
- Improved bounds for drawing trees on fixed points with L-shaped edges
- Longest Increasing and Decreasing Subsequences
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- On computing the length of longest increasing subsequences
- Patterns in permutations and words.
- Rollercoasters and caterpillars
- The communication and streaming complexity of computing the longest common and increasing subsequences
- The surprising mathematics of longest increasing subsequences
Cited in
(4)
This page was built for publication: Fast and longest rollercoasters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090479)