Range Minimum Query Indexes in Higher Dimensions

DOI10.1007/978-3-319-19929-0_13zbMath1432.68086OpenAlexW841163430MaRDI QIDQ2942253

John Iacono, Pooya Davoodi, Gad M. Landau, Moshe Lewenstein

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_13

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

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
• Two Dimensional Range Minimum Queries and Fibonacci Lattices
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
• Fast Algorithms for Finding Nearest Common Ancestors
• Two-Dimensional Range Minimum Queries
• On Cartesian Trees and Range Minimum Queries
• A unifying look at data structures
• Orthogonal Range Reporting in Three and Higher Dimensions
• Range LCP

This page was built for publication: Range Minimum Query Indexes in Higher Dimensions