scientific article
From MaRDI portal
Publication:3549595
zbMath1232.68068MaRDI QIDQ3549595
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
lower boundsrange queriescell-probe modelgroup modelstatic boundsdynamic boundsorthogonal range counting in two dimensions
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (15)
Polynomial Data Structure Lower Bounds in the Group Model ⋮ Compact binary relation representations with rich functionality ⋮ Space efficient data structures for dynamic orthogonal range counting ⋮ Entropy-bounded representation of point grids ⋮ Absent Subsequences in Words ⋮ Wavelet trees for all ⋮ Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds ⋮ Semi-group range sum revisited: query-space lower bound tightened ⋮ Substring range reporting ⋮ Towards optimal range medians ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Lower bounds for matrix factorization ⋮ Orthogonal range searching in linear and almost-linear space ⋮ Unnamed Item ⋮ Lower bounds for matrix factorization
This page was built for publication:
