Two-Dimensional Range Minimum Queries

DOI10.1007/978-3-540-73437-6_29MaRDI QIDQ3506930zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Johannes Fischer, Moshe Lewenstein

Publication date 17 June 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-73437-6_29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Range minimum queries in minimal space
• Two Dimensional Range Minimum Queries and Fibonacci Lattices
• Two dimensional range minimum queries and Fibonacci lattices
• Data structures for range minimum queries in multidimensional arrays
• Practical range minimum queries revisited
• On space efficient two dimensional range minimum data structures
• On space efficient two dimensional range minimum data structures
• Two-dimensional range diameter queries
• Direction relations and two-dimensional range queries: optimisation techniques

Cited in

(21)

• Data structures for efficient string algorithms.
• On space efficient two dimensional range minimum data structures
• A quick tour on suffix arrays and compressed suffix arrays
• On the range maximum-sum segment query problem
• Submatrix maximum queries in Monge matrices are equivalent to predecessor search
• Two dimensional range minimum queries and Fibonacci lattices
• Space-efficient data-analysis queries on grids
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Array range queries
• On space efficient two dimensional range minimum data structures
• Range minimum query indexes in higher dimensions
• Range minimum queries in minimal space
• Linear-space data structures for range mode query in arrays
• The range 1 query (R1Q) problem
• Orthogonal range searching for text indexing
• The Encoding Complexity of Two Dimensional Range Minimum Data Structures
• Quantum data structure for range minimum query
• Data structures for range minimum queries in multidimensional arrays
• Efficient dynamic range minimum query
• Two Dimensional Range Minimum Queries and Fibonacci Lattices
• On Cartesian trees and range minimum queries

This page was built for publication: Two-Dimensional Range Minimum Queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506930)