Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ICALP
2003
Springer

favoriteEmaildiscussreport

129views Programming Languages» more ICALP 2003»

The Cell Probe Complexity of Succinct Data Structures

13 years 9 months ago

The Cell Probe Complexity of Succinct Data Structures

Download www.daimi.au.dk

Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoﬀ of solutions to static data structure problems.

Anna Gál, Peter Bro Miltersen

Real-time Traffic

Cell Probe Model | ICALP 2003 | Lower Bounds | Static Data Structure | Theoretical Computer Science |

claim paper

Related Content

» CellProbe Lower Bounds for Succinct Partial Sums

» Bitprobe lower bounds for succinct data structures

» On the Cell Probe Complexity of Dynamic Membership

» On the cell probe complexity of membership and perfect hashing

» The cell probe complexity of dynamic range counting

» Prospecting for Live Cell Bioimaging Probes with Cheminformatic Assisted Image Array caia

» Lower bounds for predecessor searching in the cell probe model

» Mining MultiDimensional Constrained Gradients in Data Cubes

» Cell Probe Lower Bounds and Approximations for Range Mode

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	ICALP
Authors	Anna Gál, Peter Bro Miltersen

Comments (0)