scientific article; zbMATH DE number 6297697
From MaRDI portal
Publication:5417614
zbMath1288.68055MaRDI QIDQ5417614
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Data structures (68P05)
Related Items (18)
Two dimensional range minimum queries and Fibonacci lattices ⋮ Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search ⋮ Optimal Algorithms for Running Max and Min Filters on Random Inputs ⋮ The range 1 query (R1Q) problem ⋮ Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries ⋮ Range Minimum Query Indexes in Higher Dimensions ⋮ Entropy-bounded representation of point grids ⋮ Encoding 2D range maximum queries ⋮ Computing feasible toolpaths for 5-axis machines ⋮ A simple linear-space data structure for constant-time range minimum query ⋮ Simple and efficient fully-functional succinct trees ⋮ On Cartesian trees and range minimum queries ⋮ Reporting and counting maximal points in a query orthogonal rectangle ⋮ On space efficient two dimensional range minimum data structures ⋮ Linear-space data structures for range mode query in arrays ⋮ Faster algorithm to find anti-risk path between two nodes of an undirected graph ⋮ Range LCP ⋮ Orthogonal Range Searching for Text Indexing
This page was built for publication:
