Periodicity in streams

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

Volumn 6302 LNCS, Issue , 2010, Pages 545-559

  Ergun, Funda ^a   Jowhari, Hossein ^a   Saǧlam, Mert ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149318342     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_41     Document Type: Conference Paper

References (25)

1. Alon, N., Matias, Y., Szegedy, M.: Space complexity of approximating the frequency moments. In: STOC 1996 (1996)
2. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. In: SODA 2000 (2000)
3. Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Sampling algorithms: lower bounds and applications. In: CCC 2002 (2002)
4. Berinde, R., Cormode, G., Indyk, P., Strauss, M.: Space-optimal heavy hitters with strong error bounds. In: PODS 2009 (2009)
5. Bhuvanagiri, L., Ganguly, S., Kesh, D., Saha, C.: Simpler algorithm for estimating frequency moments of data streams. In: SODA 2006 (2006)
6. Bose, P., Kranakis, E., Morin, P., Tang, Y.: Bounds for frequency estimation of packet streams. In: Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (2003)
7. Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. Theor. Comput. Sci. 312(1), 3-15 (2004)
8. Cole, R., Hariharan, R.: Approximate String Matching: A Simpler Faster Algorithm. In: SODA 1998 (1998)
9. Cormode, G., Muthukrishnan, S.: Space efficient mining of multigraph streams. In: PODS 2005, pp. 271-282 (2005)
10. Czumaj, A., Gasieniec, L.: On the complexity of determining the period of a string. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 412-422. Springer, Heidelberg (2000)
11. Elfeky, M.G., Aref, W.G., Elmagarmid, A.K.: STAGGER: periodicity mining of data streams using expanding sliding windows. In: ICDM 2006 (2006)
12. Ergun, F., Muthukrishnan, S., Sahinalp, C.: Sublinear methods for detecting periodic trends in data streams. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 16-28. Springer, Heidelberg (2004)
13. Ganguly, S., Kesh, D., Saha, C.: Practical algorithms for tracking database join sizes. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 297-309. Springer, Heidelberg (2005)
14. Indyk, P.: Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM 53(3), 307-323 (2006)
15. Indyk, P.,Woodruff, D.: Optimal approximations of the frequency moments of data streams. In: STOC 2005 (2005)
16. Jayram, T.S., Woodruff, D.: The data stream space complexity of cascaded norms. In: FOCS 2009 (2009)
17. Kane, D.M., Nelson, J., Woodruff, D.: An optimal algorithm for the distinct elements problem. In: PODS 2010 (2010)
18. Karp, R.M., Rabin, M.O.: Efficient randomized pattern matching algorithms. IBM Journal of Res. and Dev. 249, 260 (1987)
19. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comp. 6, 323-350 (1977)
20. Lachish, O., Newman, I.: Testing periodicity. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 366-377. Springer, Heidelberg (2005)
21. Lipsky, O., Porat, E.: Improved sketching of hamming distance with error correcting. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 173-182. Springer, Heidelberg (2007)
22. Misra, J., Gries, D.: Finding repeated elements. Technical Report, Cornell University (1982)
23. Monemizadeh, M., Woodruff, D.: 1-Pass relative-error Lp-sampling with applications. In: SODA 2010 (2010)
24. Muthukrishnan, S.: Data stream algorithms. In: The Barbados Workshop on Computational Complexity (2009)
25. Porat, B., Porat, E.: Exact and approximate pattern matching in the streaming model. In: FOCS 2009 (2009)