The following pages link to (Q5417614):
Displaying 18 items.
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Computing feasible toolpaths for 5-axis machines (Q443707) (← links)
- Simple and efficient fully-functional succinct trees (Q507389) (← links)
- On Cartesian trees and range minimum queries (Q528853) (← 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)
- Faster algorithm to find anti-risk path between two nodes of an undirected graph (Q2015812) (← links)
- Reporting and counting maximal points in a query orthogonal rectangle (Q2253906) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries (Q2661782) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Range Minimum Query Indexes in Higher Dimensions (Q2942253) (← links)
- Optimal Algorithms for Running Max and Min Filters on Random Inputs (Q3196410) (← links)
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (Q3448817) (← links)
- Range LCP (Q5920340) (← links)
