Pages that link to "Item:Q3506930"
From MaRDI portal
The following pages link to Two-Dimensional Range Minimum Queries (Q3506930):
Displaying 13 items.
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- On Cartesian trees and range minimum queries (Q528853) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Array Range Queries (Q2848983) (← links)
- Range Minimum Query Indexes in Higher Dimensions (Q2942253) (← links)
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (Q3448817) (← links)
