Cell probe lower bounds for succinct data structures

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]

Abstract

Abstract is missing.