Pages that link to "Item:Q655431"
From MaRDI portal
The following pages link to Faster algorithms for computing longest common increasing subsequences (Q655431):
Displaying 15 items.
- A linear space algorithm for computing a longest common increasing subsequence (Q845723) (← links)
- The longest commonly positioned increasing subsequences problem (Q1702817) (← links)
- Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? (Q1705641) (← links)
- Longest common rollercoasters (Q2146120) (← links)
- Computing the longest common almost-increasing subsequence (Q2166775) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem (Q2224853) (← links)
- Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
- A diagonal-based algorithm for the longest common increasing subsequence problem (Q2310745) (← links)
- An efficient algorithm for the longest common palindromic subsequence problem (Q2672607) (← links)
- An efficient algorithm for enumerating longest common increasing subsequences (Q2695270) (← links)
- (Q5090981) (← links)
- (Q5111874) (← links)
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
