Tolerant property testing and distance approximation

Journal of Computer and System Sciences

Volumn 72, Issue 6, 2006, Pages 1012-1042

  Parnas, Michal ^a   Ron, Dana ^b   Rubinfeld, Ronitt ^c  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation; Clustering; Property testing; Sublinear algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER TESTING; PROBLEM SOLVING;

CLUSTERING; DISTANCE APPROXIMATION; PROPERTY TESTING; SUBLINEAR ALGORITHMS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 33746779981     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.03.002     Document Type: Article

References (27)

1. N. Ailon, B. Chazelle, Information theory in property testing and monotonicity testing in higher dimensions, in: Proceedings of the Twenty-Second Annual Symposium on Theoretical Aspects of Computer Science, STACS, 2005, pp. 434-447
2. N. Ailon, B. Chazelle, S. Comandur, D. Liu, Estimating the distance to a monotone function, in: Proceedings of the Eight International Workshop on Randomization and Computation, RANDOM, 2004, 229-236
3. Alon N., Dar S., Parnas M., and Ron D. Testing of clustering. SIAM J. Discrete Math. 16 3 (2003) 393-417
4. N. Alon, A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, in: Proceedings of the Forty-Sixth Annual Symposium on Foundations of Computer Science, FOCS, 2005, pp. 429-438
5. T. Batu, F. Ergun, J. Kilian, A. Magen, S. Raskhodnikova, R. Rubinfeld, Rahul Sami, A sublinear algorithm for weakly approximating edit distance, in: Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, STOC, 2003, pp. 316-324
6. T. Batu, L. Fortnow, R. Rubinfeld, W. Smith, P. White, Testing that distributions are close, in: Proceedings of the Forty-First Annual Symposium on Foundations of Computer Science, FOCS, 2000, pp. 259-269
7. Batu T., Rubinfeld R., and White P. Fast approximate PCPs for multidimensional bin-packing problems. Inform. and Comput. 196 1 (2005) 42-56
8. Blum M., Luby M., and Rubinfeld R. Self-testing/correcting with applications to numerical problems. J. ACM 47 (1993) 549-595
9. M. Charikar, L. O'Callaghan, R. Panigraphy, Better streaming algorithms for clustering problems, in: Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, STOC, 2003, pp. 30-39
10. B. Chazelle, R. Rubinfeld, L. Trevisan, Approximating the minimum spanning tree weight in sublinear time, in: Automata, Languages and Programming: Twenty-Eighth International Colloquium, ICALP, 2001, pp. 190-200
11. Czumaj A., and Sohler C. Abstract combinatorial programs and efficient property testers. SIAM J. Comput. 34 3 (2005) 580-615
12. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, A. Samorodnitsky, Improved testing algorithms for monotonicity, in: Proceedings of the Third International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM, 1999, pp. 97-108
13. Ergun F., Kannan S., Kumar S.R., Rubinfeld R., and Viswanathan M. Spot-checkers. J. Comput. System Sci. 60 3 (2000) 717-751
14. Fischer E. The art of uninformed decisions: A primer to property testing. Bull. Eur. Assoc. Theor. Comput. Sci. 75 (2001) 97-126
15. Fischer E. On the strength of comparisons in property testing. Inform. and Comput. 189 1 (2004) 107-116
16. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, A. Samorodnitsky, Monotonicity testing over general poset domains, in: Proceedings of the Thirty-Fourth Annual ACM Symposium on the Theory of Computing, STOC, 2002, pp. 474-483
17. E. Fischer, I. Newman, Testing versus estimation of graph properties, in: Proceedings of the Thirty-Sixth Annual ACM Symposium on the Theory of Computing, STOC, 2005, pp. 138-146
18. O. Goldreich, Combinatorial property testing-a survey, in: Randomization Methods in Algorithm Design, 1998, pp. 45-60
19. Goldreich O., Goldwasser S., Lehman E., Ron D., and Samorodnitsky A. Testing monotonicity. Combinatorica 20 3 (2000) 301-337
20. Goldreich O., Goldwasser S., and Ron D. Property testing and its connection to learning and approximation. J. ACM 45 4 (1998) 653-750
21. V. Guruswami, A. Rudra, Tolerant locally testable codes, in: Proceedings of the Ninth International Workshop on Randomization and Computation, RANDOM, 2005, pp. 306-317
22. S. Halevy, E. Kushilevitz, Distribution-free property testing, in: Proceedings of the Seventh International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM, 2003, pp. 302-317
23. S. Halevy, E. Kushilevitz, Testing monotonicity over graph products, in: Automata, Languages and Programming: Thirty-First International Colloquium, ICALP, 2004, pp. 721-732
24. Kearns M.J., Schapire R.E., and Sellie L.M. Toward efficient agnostic learning. Machine Learning 17 2-3 (1994) 115-141
25. Parnas M., Ron R., and Rubinfeld R. Tolerant property testing and distance approximation. Technical Report TR04-010, Electronic Colloquium on Computational Complexity (ECCC), available from (2004). http://www.eccc.uni-trier.de/eccc/
26. Ron D. Property testing. In: Rajasekaran S., Pardalos P.M., Reif J.H., and Rolim J.D.P. (Eds). Handbook on Randomization, vol. II (2001) 597-649
27. Rubinfeld R., and Sudan M. Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25 2 (1996) 252-271