Two Dimensional Range Minimum Queries and Fibonacci Lattices

DOI10.1007/978-3-642-33090-2_20MaRDI QIDQ2912843zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal, Pooya Davoodi, Rajeev Raman, S. Srinivasa Rao, 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)

Recommendations

• Two-Dimensional Range Minimum Queries
• The Encoding Complexity of Two Dimensional Range Minimum Data Structures
• On space efficient two dimensional range minimum data structures
• On space efficient two dimensional range minimum data structures
• Efficient search for two-dimensional rank-1 lattices with applications in graphics
• Practical range minimum queries revisited
• Range minimum queries in minimal space
• On Cartesian Trees and Range Minimum Queries

Cited in

(11)

• Dynamic path queries in linear space
• Linear-space data structures for range mode query in arrays
• Succinct indices for path minimum, with applications
• Space efficient data structures for nearest larger neighbor
• Orthogonal range searching for text indexing
• The Encoding Complexity of Two Dimensional Range Minimum Data Structures
• Range minimum query indexes in higher dimensions
• Two dimensional range minimum queries and Fibonacci lattices
• Submatrix maximum queries in Monge matrices are equivalent to predecessor search
• Two-Dimensional Range Minimum Queries
• On space efficient two dimensional range minimum data structures

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 Q2912843)