Sciweavers

Share
ICALP
2003
Springer

The Cell Probe Complexity of Succinct Data Structures

8 years 8 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where ICALP
Authors Anna Gál, Peter Bro Miltersen
Comments (0)
books