Two dimensional range minimum queries and Fibonacci lattices
From MaRDI portal
Publication:294929
DOI10.1016/J.TCS.2016.02.016zbMATH Open1344.68056OpenAlexW4235521382MaRDI QIDQ294929FDOQ294929
Authors: Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti 
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
Recommendations
Cites Work
- Succinct representations of binary trees for range minimum queries
- On Cartesian Trees and Range Minimum Queries
- Geometric discrepancy. An illustrated guide
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- 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 Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Two-Dimensional Range Minimum Queries
- How to find a battleship
- A unifying look at data structures
- Data structures for range minimum queries in multidimensional arrays
- On space efficient two dimensional range minimum data structures
Cited In (3)
This page was built for publication: Two dimensional range minimum queries and Fibonacci lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294929)
