Data structure lower bounds on random access to grammar-compressed strings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7922 LNCS, Issue , 2013, Pages 247-258

  Verbin, Elad ^a   Yu, Wei ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY; DISJOINTNESS; LOWER BOUNDS; QUERY TIME; RAM MODEL; RANDOM ACCESS; RUNNING TIME; SETTING OF PARAMETERS;

PATTERN MATCHING; PROBES; RANDOM ACCESS STORAGE;

DATA STRUCTURES;

EID: 84884322827     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38905-4_24     Document Type: Conference Paper

References (12)

1. Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity theory. In: FOCS, pp. 337-347 (1985)
2. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. Journal of Computer and System Sciences 68(4), 702-732 (2004)
3. Bille, P., Landau, G.M., Raman, R., Rao, S., Sadakane, K., Weimann, O.: Random access to grammar compressed strings. In: SODA (2011)
4. Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Transactions on Information Theory 51(7), 2554-2576 (2005)
5. Claude, F., Navarro, G.: Self-indexed text compression using straight-line programs. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 235-246. Springer, Heidelberg (2009)
6. Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Transactions on Information Theory 22(1), 75-81 (1976)
7. Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A.: On data structures and asymmetric communication complexity. In: STOC, p. 111. ACM (1995)
8. Patrascu, M.: Unifying the Landscape of Cell-Probe Lower Bounds. SIAM Journal on Computing 40(3) (2011)
9. Razborov, A.A.: On the distributional complexity of disjointness. Theoretical Computer Science 106(2), 385-390 (1992)
10. Yao, A.C.C.: Should tables be sorted? Journal of the ACM 28(3), 615-628 (1981)
11. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on information theory 23(3), 337-343 (1977)
12. Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24(5), 530-536 (1978)