Two dimensional range minimum queries and Fibonacci lattices
From MaRDI portal
Publication:294929
DOI10.1016/j.tcs.2016.02.016zbMath1344.68056MaRDI QIDQ294929
Srinivasa Rao Satti, Moshe Lewenstein, Pooya Davoodi, Gerth Stølting Brodal, Rajeev Raman
Publication date: 16 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.016
68P05: Data structures
Cites Work
- Unnamed Item
- On space efficient two dimensional range minimum data structures
- Encoding 2D range maximum queries
- Succinct data structures for flexible text retrieval systems
- Polymorphic arrays: A novel VLSI layout for systolic computers
- Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima
- Succinct Representations of Binary Trees for Range Minimum Queries
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Two-Dimensional Range Minimum Queries
- On Cartesian Trees and Range Minimum Queries
- How to find a battleship
- A unifying look at data structures
- Geometric discrepancy. An illustrated guide