On space efficient two dimensional range minimum data structures
From MaRDI portal
Publication:3586393
Recommendations
Cited in
(17)- The range 1 query (R1Q) problem
- Semi-group range sum revisited: query-space lower bound tightened
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Linear-space data structures for range mode query in arrays
- Tight lower bounds for the longest common extension problem
- The Encoding Complexity of Two Dimensional Range Minimum Data Structures
- Two Dimensional Range Minimum Queries and Fibonacci Lattices
- Range minimum query indexes in higher dimensions
- Two dimensional range minimum queries and Fibonacci lattices
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Submatrix maximum queries in Monge matrices are equivalent to predecessor search
- Two-Dimensional Range Minimum Queries
- Data structures for range minimum queries in multidimensional arrays
- Construction of sparse suffix trees and LCE indexes in optimal time and space
- On space efficient two dimensional range minimum data structures
- Two-dimensional range successor in optimal time and almost linear space
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 Q3586393)