Bit-probe lower bounds for succinct data structures

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 475-481

  Viola, Emanuele ^a  

^a Northeastern University   (United States)

Author keywords

Bit probe; Cell probe; Dictionary; Logarithmic form; Lower bound; Membership query; Succinct data structure; Ternary value

Indexed keywords

DICTIONARY; LOGARITHMIC FORM; LOWER BOUND; MEMBERSHIP QUERY; SUCCINCT DATA STRUCTURE; TERNARY VALUE;

CODES (SYMBOLS); COMPUTATION THEORY; DATA STRUCTURES; PROBES;

CONTROL THEORY;

EID: 70350688093     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536480     Document Type: Conference Paper

References (19)

1. A. Baker. Transcendental number theory. Cambridge Mathematical Library. Cambridge University Press, second edition, 1990.
2. A. Baker and G. Wüstholz. Logarithmic forms and Diophantine geometry, volume 9 of New Mathematical Monographs. Cambridge University Press, 2007.
3. H. Buhrman, P. B. Miltersen, J. Radhakrishnan, and V. Srinivasan. Are bitvectors optimal? SIAM J. Comput., 31(6):1723{1744, 2002.
4. T. M. Cover and J. A. Thomas. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing). Wiley-Interscience, 2006.
5. J. Edmonds, R. Impagliazzo, S. Rudich, and J. Sgall. Communication complexity towards lower bounds on circuit depth. Computational Complexity, 10(3):210{246, 2001.
6. R. F. Geary, N. Rahman, R. Raman, and V. Raman. A simple optimal representation for balanced parentheses. Theor. Comput. Sci., 368(3):231{246, 2006.
7. A. Golynski. Cell probe lower bounds for succinct data structures. In 20th Symposium on Discrete Algorithms (SODA), pages 625{634. ACM-SIAM, 2009.
8. T. Holenstein. Parallel repetition: simpli cations and the no-signaling case (extended abstract). In 39th Symposium on Theory of Computing (STOC), pages 411{419. ACM, 2007.
9. P. B. Miltersen. Cell probe complexity - a survey. In 19th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 1999. Advances in Data Structures Workshop, 1999.
10. M. Minsky and S. Papert. Perceptrons. MIT Press, Cambridge, MA, 1969.
11. M. Mitzenmacher. Compressed bloom lters. In 20th Symposium on Principles of distributed computing (PODC), pages 144{150. ACM, 2001.
12. R. Pagh. Low redundancy in static dictionaries with constant query time. SIAM J. Comput., 31(2):353{363, 2001.
13. R. Pagh. On the cell probe complexity of membership and perfect hashing. In 33rd Annual Symposium on Theory of Computing (STOC), pages 425{432. ACM, 2001.
14. M. Pǎtraşcu. Succincter. In 49th Symposium on Foundations of Computer Science (FOCS). IEEE, 2008.
15. M. Pǎtraşcu and C. E. Tarniţǎ. On dynamic bit-probe complexity. Theoret. Comput. Sci., 380(1-2):127{142, 2007.
16. M. Pǎtraşcu and M. Thorup. Succincter-er, 2009. Manuscript.
17. R. Raz. A parallel repetition theorem. SIAM J. Comput., 27(3):763{803 (electronic), 1998.
18. R. Shaltiel and E. Viola. Hardness ampli cation proofs require majority. In 40th Annual Symposium on the Theory of Computing (STOC), pages 589{598. ACM, 2008.
19. E. Viola. The Complexity of Hardness Ampli cation and Derandomization. PhD thesis, Harvard University, 2006. www.eccc.uni-trier. de/.