Range longest increasing subsequence and its relatives
From MaRDI portal
Cites work
- 4D range reporting in the pointer machine model in almost-optimal time
- Approximate colored range and point enclosure queries
- Approximate counting of inversions in a data stream
- Approximate range counting revisited
- Approximate range counting revisited
- Approximation algorithms for LCS and LIS with truly improved running times
- Better Data Structures for Colored Orthogonal Range Reporting
- Colored range closest-pair problem under general distance functions
- Computational geometry. Algorithms and applications.
- Dynamic algorithms for LIS and distance to monotonicity
- Dynamic Colored Orthogonal Range Searching.
- Dynamic Planar Range Maxima Queries
- Efficient range searching for categorical and plain data
- Estimating the longest increasing sequence in polylogarithmic time
- Estimating the longest increasing subsequence in nearly optimal time
- Estimating the sortedness of a data stream
- External memory three-sided range reporting and top-\(k\) queries with sublogarithmic updates
- Fast context-free grammar parsing requires fast Boolean matrix multiplication
- Fast distance multiplication of unit-Monge matrices
- Finding longest increasing and common subsequences in streaming data
- Fully dynamic approximation of LIS in polylogarithmic time
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Graph expansion and communication costs of fast matrix multiplication
- scientific article; zbMATH DE number 6381708 (Why is no real title available?)
- scientific article; zbMATH DE number 5764793 (Why is no real title available?)
- scientific article; zbMATH DE number 5506192 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 2226802 (Why is no real title available?)
- scientific article; zbMATH DE number 7760157 (Why is no real title available?)
- I/O-efficient data structures for colored range and prefix reporting
- Improved dynamic algorithms for longest increasing subsequence
- Linear-space data structures for range mode query in arrays
- Longest increasing subsequences in sliding windows
- Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence
- Near-optimal range reporting structures for categorical data
- New bounds for range closest-pair problems
- New sublinear algorithms and lower bounds for LIS estimation
- New upper bounds for generalized intersection searching problems
- On computing the length of longest increasing subsequences
- On dynamic shortest paths problems
- On space efficient two dimensional range minimum data structures
- Online sorted range reporting
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
- Optimal color range reporting in one dimension
- Optimal planar orthogonal skyline counting queries
- Ordered and unordered top-\(K\) range reporting in large data sets
- Orthogonal Range Reporting in Three and Higher Dimensions
- Orthogonal range searching on the RAM, revisited
- Popular conjectures imply strong lower bounds for dynamic problems
- Range searching in categorical data: Colored range searching on grid
- Searching for the closest-pair in a query translate
- Semi-local longest common subsequences in subquadratic time
- Semi-local string comparison: algorithmic techniques and applications
- The buffer tree: A technique for designing batched external data structures
- The communication and streaming complexity of computing the longest common and increasing subsequences
- Top-\(K\) color queries for document retrieval
- Towards optimal range medians
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
This page was built for publication: Range longest increasing subsequence and its relatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445615)