Testing periodicity

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 366-377

  Lachish, Oded ^a   Newman, Ilan ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; PHASE TRANSITIONS; QUERY LANGUAGES; RANDOM PROCESSES;

EXPONENTIAL PHASE TRANSITIONS; PERIODICITY; PERIODICITY TESTING; QUERY COMPLEXITY;

TIME VARYING SYSTEMS;

EID: 26944477374     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_31     Document Type: Conference Paper

References (13)

1. S. Goldwasser O. Goldreich and D. Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45:653-750, 1998.
2. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal of Computing, 25:252-271, 1996.
3. F. Ergun, S. Muthukrishnan, and C. Sahinalp. Sub-linear methods for detecting periodic trends in data streams. In LATIN 2004, Proc. of the 6th Latin American Symposium on Theoretical Informatics, pages 16-28, 2004.
4. P. Indyk, N. Koudas, and S. Muthukrishnan. Identifying representative trends in massive time series data sets using sketches. In VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, September 10-14, 2000, Cairo, Egypt, pages 363-372. Morgan Kaufmann, 2000.
5. R. Krauthgamer O. Sasson. Property testing of data dimensionality. In Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pages 18-27. Society for Industrial and Applied Mathematics, 2003.
6. A. C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss. Near-optimal sparse fourier representations via sampling. In STOC 2002, Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, pages 152-161, 2002.
7. Alex Samorodnitsky and Luca Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proc. of the 32 ACM STOC, pages 191-199, 2000.
8. Johan Hästad and Avi Wigderson. Simple analysis of graph tests for linearity and pcp. Random Struct. Algorithms, 22(2):139-160, 2003.
9. E. Fischer. The art of uninformed decisions: A primer to property testing. The computational complexity column of The Bulletin of the European Association for Theoretical Computer Science, 75:97-126, 2001.
10. D. Ron. Property testing (a tutorial). In Handbook of Randomized computing, pages 597-649. Kluwer Press, 2001.
11. J. Hadamard. Sur la distribution des zéros de la fonction ζ(s) et ses conséquences arithmétiques. Bull. Soc. Math. France, 24:199-220, 1896.
12. V. Poussin. Recherces analytiques sur la théorie des nombres premiers. Ann. Soc. Sci. Bruxelles, 1897.
13. D.J. Newman. Simple analytic proof of the prime number theorem. Amer. Math. Monthly, 87:693-396, 1980.