On space efficient two dimensional range minimum data structures
From MaRDI portal
Publication:3586393
DOI10.1007/978-3-642-15781-3_15zbMATH Open1287.68026OpenAlexW1858259429MaRDI QIDQ3586393FDOQ3586393
Authors: Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao 
Publication date: 6 September 2010
Published in: Algorithms – ESA 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15781-3_15
Recommendations
Cited In (16)
- Two-Dimensional Range Minimum Queries
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Submatrix maximum queries in Monge matrices are equivalent to predecessor search
- Semi-group range sum revisited: query-space lower bound tightened
- Tight lower bounds for the longest common extension problem
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Two dimensional range minimum queries and Fibonacci lattices
- Range minimum query indexes in higher dimensions
- On space efficient two dimensional range minimum data structures
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Linear-space data structures for range mode query in arrays
- The range 1 query (R1Q) problem
- Two-dimensional range successor in optimal time and almost linear space
- The Encoding Complexity of Two Dimensional Range Minimum Data Structures
- Data structures for range minimum queries in multidimensional arrays
- Two Dimensional Range Minimum Queries and Fibonacci Lattices
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)
