Pages that link to "Item:Q1959440"

The following pages link to Fast computation of a longest increasing subsequence and application (Q1959440):

Displaying 18 items.

• Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
• The longest commonly positioned increasing subsequences problem (Q1702817) (← links)
• Improvised divide and conquer approach for the LIS problem (Q1748198) (← links)
• Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
• Fast and longest rollercoasters (Q2118392) (← links)
• A faster reduction of the dynamic time warping distance to the longest increasing subsequence length (Q2165031) (← 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)
• On-line scheduling with monotone subsequence constraints (Q2319898) (← links)
• A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738) (← links)
• Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
• Rollercoasters and Caterpillars (Q5002684) (← links)
• (Q5090479) (← links)
• (Q5111874) (← links)
• Rollercoasters: Long Sequences without Short Runs (Q5232132) (← links)
• Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537) (← links)
• Longest increasing subsequence under persistent comparison errors (Q5916089) (← links)
• The longest almost increasing subsequence problem with sliding windows (Q6562878) (← links)