@InProceedings{gal_et_al:DagSemProc.06111.17,
author = {G\'{a}l, Anna and Miltersen, Peter Bro},
title = {{The Cell Probe Complexity of Succinct Data Structures}},
booktitle = {Complexity of Boolean Functions},
pages = {1--13},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.17},
URN = {urn:nbn:de:0030-drops-6065},
doi = {10.4230/DagSemProc.06111.17},
annote = {Keywords: Cell probe model, data structures, lower bounds, time-space tradeoffs}
}