Enumerating longest increasing subsequences and patience sorting
From MaRDI portal
Recommendations
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Longest increasing subsequences in pattern-restricted permutations
- An efficient algorithm for enumerating longest common increasing subsequences
- scientific article; zbMATH DE number 3860389
- Fast computation of a longest increasing subsequence and application
- scientific article; zbMATH DE number 6970852
- On two variants of the longest increasing subsequence problem
- scientific article; zbMATH DE number 1515819
- The longest commonly positioned increasing subsequences problem
- Longest increasing subsequences in sliding windows
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- A fast algorithm for computing longest common subsequences
- 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
- Preserving order in a forest in less than logarithmic time and linear space
Cited in
(33)- scientific article; zbMATH DE number 7559139 (Why is no real title available?)
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence
- Fast RSK correspondence by doubling search
- The longest almost increasing subsequence problem with sliding windows
- Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs
- A fast algorithm for computing a longest common increasing subsequence
- A linear space algorithm for computing a longest common increasing subsequence
- Fast and longest rollercoasters
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
- The monoids of the patience sorting algorithm
- Improvised divide and conquer approach for the LIS problem
- Move schedules: fast persistence computations in coarse dynamic settings
- On-line scheduling with monotone subsequence constraints
- The longest wave subsequence problem: generalizations of the longest increasing subsequence problem
- Subsequences in bounded ranges: matching and analysis problems
- A review of metrics on permutations for search landscape analysis
- Space-efficient algorithms for longest increasing subsequence
- Space-efficient algorithms for longest increasing subsequence
- An experimental comparison of algebraic crossover operators for permutation problems
- A geometric form for the extended patience sorting algorithm
- Co-divergence and tree topology
- Longest increasing subsequences in windows based on canonical antichain partition
- Longest increasing subsequences in sliding windows
- Fast computation of a longest increasing subsequence and application
- Commentary on ``Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem by David Aldous and Persi Diaconis
- Restricted patience sorting and barred pattern avoidance
- Faster algorithms for computing longest common increasing subsequences
- FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
- Efficient algorithms for finding a longest common increasing subsequence
- A diagonal-based algorithm for the longest common increasing subsequence problem
- Combinatorics of patience sorting monoids
- Finding longest increasing and common subsequences in streaming data
This page was built for publication: Enumerating longest increasing subsequences and patience sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294846)
