Two Dimensional Range Minimum Queries and Fibonacci Lattices

DOI10.1007/978-3-642-33090-2_20zbMath1365.68172OpenAlexW17470385MaRDI QIDQ2912843

Pooya Davoodi, S. Srinivasa Rao, Rajeev Raman, Gerth Stølting Brodal, Moshe Lewenstein

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Two_Dimensional_Range_Minimum_Queries_and_Fibonacci_Lattices/10168022

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (7)

Succinct indices for path minimum, with applications ⋮ Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search ⋮ Space efficient data structures for nearest larger neighbor ⋮ Range Minimum Query Indexes in Higher Dimensions ⋮ Linear-space data structures for range mode query in arrays ⋮ Dynamic path queries in linear space ⋮ Orthogonal Range Searching for Text Indexing

This page was built for publication: Two Dimensional Range Minimum Queries and Fibonacci Lattices