Alexander Golynski. Cell probe lower bounds for succinct data structures. In Claire Mathieu, editor, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009. pages 625-634, SIAM, 2009. [doi]
@inproceedings{Golynski09,
title = {Cell probe lower bounds for succinct data structures},
author = {Alexander Golynski},
year = {2009},
doi = {10.1145/1496770.1496839},
url = {http://doi.acm.org/10.1145/1496770.1496839},
tags = {data-flow},
researchr = {https://researchr.org/publication/Golynski09},
cites = {0},
citedby = {0},
pages = {625-634},
booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009},
editor = {Claire Mathieu},
publisher = {SIAM},
}