Two-Dimensional Range Minimum Queries

DOI10.1007/978-3-540-73437-6_29zbMath1138.68654OpenAlexW1575902893MaRDI QIDQ3506930

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)

Related Items (13)

Two dimensional range minimum queries and Fibonacci lattices ⋮ Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search ⋮ The range 1 query (R1Q) problem ⋮ Range Minimum Query Indexes in Higher Dimensions ⋮ Space-efficient data-analysis queries on grids ⋮ Encoding 2D range maximum queries ⋮ A simple linear-space data structure for constant-time range minimum query ⋮ On Cartesian trees and range minimum queries ⋮ On space efficient two dimensional range minimum data structures ⋮ Linear-space data structures for range mode query in arrays ⋮ A quick tour on suffix arrays and compressed suffix arrays ⋮ Orthogonal Range Searching for Text Indexing ⋮ Array Range Queries

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