scientific article; zbMATH DE number 5485435
From MaRDI portal
Publication:3549595
zbMATH Open1232.68068MaRDI QIDQ3549595FDOQ3549595
Authors: Mihai Patrascu 
Publication date: 5 January 2009
Title of this publication is not available (Why is that?)
lower boundsrange queriescell-probe modelgroup modelstatic boundsdynamic boundsorthogonal range counting in two dimensions
Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (15)
- Lower bounds for matrix factorization
- Lower bounds for matrix factorization
- Towards optimal range medians
- Orthogonal range searching in linear and almost-linear space
- Polynomial data structure lower bounds in the group model
- Semi-group range sum revisited: query-space lower bound tightened
- Substring range reporting
- Title not available (Why is that?)
- Absent Subsequences in Words
- Compact binary relation representations with rich functionality
- Fully functional static and dynamic succinct trees
- Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
- Wavelet trees for all
- Space efficient data structures for dynamic orthogonal range counting
- Entropy-bounded representation of point grids
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549595)
