Two dimensional range minimum queries and Fibonacci lattices

DOI10.1016/J.TCS.2016.02.016MaRDI QIDQ294929zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

pattern matchingFibonacci latticesrange minimum queries

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Two Dimensional Range Minimum Queries and Fibonacci Lattices
• On space efficient two dimensional range minimum data structures
• On space efficient two dimensional range minimum data structures
• Two-Dimensional Range Minimum Queries
• Range minimum query indexes in higher dimensions

Cites work

• A unifying look at data structures
• Data structures for range minimum queries in multidimensional arrays
• Geometric discrepancy. An illustrated guide
• How to find a battleship
• On Cartesian Trees and Range Minimum Queries
• On space efficient two dimensional range minimum data structures
• Polymorphic arrays: A novel VLSI layout for systolic computers
• Space-efficient preprocessing schemes for range minimum queries on static arrays
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Succinct data structures for flexible text retrieval systems
• Succinct indices for range queries with applications to orthogonal range maxima
• Succinct representations of binary trees for range minimum queries
• Two-Dimensional Range Minimum Queries

Cited in

(3)

• Two-Dimensional Range Minimum Queries
• On space efficient two dimensional range minimum data structures
• The Encoding Complexity of 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 Q294929)