Space lower bounds for online pattern matching

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

Volumn 6661 LNCS, Issue , 2011, Pages 184-196

  Clifford, Raphaël ^a   Jalsenius, Markus ^a   Porat, Ely ^b   Sach, Benjamin ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CROSS CORRELATIONS; DISTANCE FUNCTIONS; DISTANCE MEASURE; LOWER BOUNDS; NON-BINARY; PATTERN MATCHING PROBLEMS; SLIDING WINDOW; SPACE BOUNDS;

ELECTROSTATIC DISCHARGE;

PATTERN MATCHING;

EID: 79960079143     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21458-5_17     Document Type: Conference Paper

References (14)

1. Amir, A., Aumann, Y., Landau, G., Lewenstein, M., Lewenstein, N.: Pattern Matching with Swaps. Journal of Algorithms 37, 247-266 (2000)
2. Bar-Yossef, Z., Jayram, T.S., Krauthgamer, R., Kumar, R.: Approximating edit distance efficiently. In: FOCS 2004: Proc. 45th Annual Symp. Foundations of Computer Science, pp. 550-559 (2004)
3. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing 17(2), 230-261 (1988)
4. Datar, M., Gionis, A., Inkyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. SIAM Journal on computing 31(6), 1794-1813 (2002)
5. Huang, W., Shi, Y., Zhang, S., Zhu, Y.: The communication complexity of the Hamming distance problem. Information Processing Letters 99(4), 149-153 (2006)
6. Jayram, T.S., Kumar, R., Sivakumar, D.: The one-way communication complexity of hamming distance. Theory of Computing 4(1), 129-135 (2008)
7. Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, Cambridge (1997)
8. Linhart, C., Shamir, R.: Faster pattern matching with character classes using prime number encoding. Journal of Computer and System Sciences 75(3), 155-162 (2009)
9. Muthukrishnan, S., Ramesh, H.: String matching under a general matching relation. Inf. Comput. 122(1), 140-148 (1995)
10. Newman, I.: Private vs. common random bits in communication complexity. Information Processing Letters 39(2), 67-71 (1991)
11. Nisan, N.: Personal communication (2011)
12. Pǎtraşcu, M.: CC4: One-Way Communication and a Puzzle, 2009 (accessed January 20, 2011), http://infoweekly.blogspot.com/2009/04/cc4-one- way-communication-and-puzzle.html
13. Porat, B., Porat, E.: Exact and approximate pattern matching in the streaming model. In: FOCS 2009: Proc. 50th Annual Symp. Foundations of Computer Science, pp. 315-323 (2009)
14. Yao, A.C.-C.: Some complexity questions related to distributive computing. In: STOC 1979: Proc. 11th Annual ACM Symp. Theory of Computing, pp. 209-213 (1979)