On space efficient two dimensional range minimum data structures
From MaRDI portal
Recommendations
- On space efficient two dimensional range minimum data structures
- The Encoding Complexity of Two Dimensional Range Minimum Data Structures
- Two-Dimensional Range Minimum Queries
- Data structures for range minimum queries in multidimensional arrays
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Range minimum queries in minimal space
- Tight space bounds for two-dimensional approximate range counting
- Linear-space data structures for range minority query in arrays
- Linear-space data structures for range minority query in arrays
- Linear space data structures for two types of range search
Cites work
- scientific article; zbMATH DE number 3478389 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 6146456 (Why is no real title available?)
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- A unifying look at data structures
- An(other) Entropy-Bounded Compressed Suffix Tree
- Compressed suffix trees with full functionality
- Data structures for range minimum queries in multidimensional arrays
- Decomposable searching problems
- Dominance made simple
- Dynamic orthogonal range queries in OLAP.
- Fast Algorithms for Finding Nearest Common Ancestors
- Finding dominators revisited (extended abstract)
- Lempel-Ziv factorization using less time \& space
- Lowest common ancestors in trees and directed acyclic graphs
- Nearest common ancestors: a survey and a new algorithm for a distributed environment
- On Cartesian Trees and Range Minimum Queries
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Optimal lower bounds for rank and select indexes
- Optimal succinctness for range minimum queries
- Replacing suffix trees with enhanced suffix arrays
- Space-Efficient Algorithms for Document Retrieval
- Succinct data structures for flexible text retrieval systems
- The cell probe complexity of succinct data structures
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Two-Dimensional Range Minimum Queries
Cited in
(23)- Two-Dimensional Range Minimum Queries
- Space efficient data structures for nearest larger neighbor
- The effective entropy of next/previous larger/smaller value queries
- Succinct indices for path minimum, with applications
- On space efficient two dimensional range minimum data structures
- Space efficient data structures for nearest larger neighbor
- On hardness of several string indexing problems
- Two dimensional range minimum queries and Fibonacci lattices
- Array range queries
- Reporting and counting maximal points in a query orthogonal rectangle
- Range minimum query indexes in higher dimensions
- Encoding two-dimensional range top-\(k\) queries revisited
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- The range 1 query (R1Q) problem
- Succinct encodings for families of interval graphs
- Fast string dictionary lookup with one error
- Orthogonal range searching for text indexing
- The Encoding Complexity of Two Dimensional Range Minimum Data Structures
- Encoding two-dimensional range top-\(k\) queries
- Data structures for range minimum queries in multidimensional arrays
- Time-space trade-offs for longest common extensions
- Two Dimensional Range Minimum Queries and Fibonacci Lattices
- Algorithms and hardness for the longest common subsequence of three strings and related problems
This page was built for publication: On space efficient two dimensional range minimum data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692632)
