Longest increasing subsequences in sliding windows
From MaRDI portal
Publication:1885912
DOI10.1016/j.tcs.2004.03.057zbMath1067.68053OpenAlexW2077484872WikidataQ59442124 ScholiaQ59442124MaRDI QIDQ1885912
Alejandro López-Ortiz, Alexander Golynski, Mohammad Ali Safari, S. Srinivasa Rao, Michael Henry Albert, Angèle M. Hamel
Publication date: 12 November 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.057
Related Items
Longest increasing subsequences in windows based on canonical antichain partition ⋮ On the longest increasing subsequence of a circular list ⋮ Online Scheduling with Increasing Subsequence Serving Constraint ⋮ On-line Scheduling with a Monotonous Subsequence Constraint ⋮ Succinct summing over sliding windows ⋮ Improvised divide and conquer approach for the LIS problem ⋮ An algorithm for solving the longest increasing circular subsequence problem ⋮ The longest almost-increasing subsequence ⋮ On-line scheduling with monotone subsequence constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Enumerating longest increasing subsequences and patience sorting
- Distributed streams algorithms for sliding windows
- New clique and independent set algorithms for circle graphs
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- Hydrodynamical methods for analyzing longest increasing subsequences
- The Robinson-Schensted and Schützenberger algorithms, an elementary approach
- Permutations, matrices, and generalized Young tableaux
- Longest Increasing and Decreasing Subsequences
- A fast algorithm for computing longest common subsequences
- Design and implementation of an efficient priority queue
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Maintaining Stream Statistics over Sliding Windows
This page was built for publication: Longest increasing subsequences in sliding windows
