Sublinear time algorithms

International Congress of Mathematicians, ICM 2006

Volumn 3, Issue , 2006, Pages 1095-1110

  Rubinfeld, Ronitt ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Property testing; Sublinear time algorithms

Indexed keywords

PROPERTY-TESTING; SUBLINEAR TIME ALGORITHMS;

ALGORITHMS;

EID: 77952077012     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. Alon, N., Testing subgraphs in large graphs. In Proceedings of the 46th Symposium on Foundations of Computer Science, IEEE Computer Soc. Press, Los Alamitos, CA, 2001, 434-441.
2. Alon, N., Fischer, E., Krivelevich, M., and Szegedy, M., Efficient testing of large graphs. Combinatorica 20 (2000), 451-476.
3. Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., and Ron, D., Testing low-degree polynomials over GF(2). In Approximation, randomization, and combinatorial optimization, Lecture Notes in Comput. Sci. 2764, Springer-Verlag, Berlin 2003, 188-199.
4. Alon, N., Kaufman, T., Krivelevich, M., Ron, D., Testing triangle-freeness in general graphs. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York 2006, 279-288.
5. Alon, N., and Shapira, A., A characterization of the (natural) graph properties testable with one-sided error. In Proceedings of the 46th Annual Symposium on Foundations of Computer Science, IEEE Computer Soc. Press, Los Alamitos, CA, 2005, 429-438.
6. Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M., Proof verification and the hardness of approximation problems. J. ACM 45 (3) (1998), 501-555.
7. Arora, S., and Sudan, M., Improved low degree testing and its applications. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, ACM Press, New York 1997, 485-495.
8. Batu, T., Dasgupta, S., Kumar, R., and Rubinfeld, R., The complexity of approximating the entropy. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, ACM Press, New York 2002, 678-687.
9. Batu, T., Fischer, E., Fortnow, L., Kumar, R., Rubinfeld, R., and White, P., Testing random variables for independence and identity. In Proceedings of the 42nd Conference on Foundations of Computer Science, IEEE Computer Soc. Press, Los Alamitos, CA, 2001, 442-451.
10. Batu, T., Fortnow, L., Rubinfeld, R., Smith, W., and White, P., Testing that distributions are close. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 2000, 259-269.
11. Batu, T., Kumar, R., and Rubinfeld, R., Sublinear algorithms for testing monotone and unimodal distributions. In Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, ACM Press, New York 2004, 381-390.
12. Bellare, M., Coppersmith, D., Håstad, J., Kiwi, M., and M. Sudan, M., Linearity testing over characteristic two. IEEE Trans. Inform. Theory 42 (6) (1996), 1781-1795.
13. Ben-Or, M., Coppersmith, D., Luby, M., and Rubinfeld, R., Non-abelian homomorphism testing, and distributions close to their self-convolutions. In Approximation, randomization, and combinatorial optimization. Algorithms and techniques, Lecture Notes in Comput. Sci. 3122, Springer-Verlag, Berlin 2004, 273-285.
14. Blum, M., Luby, M., and Rubinfeld, R., Self-testing/correcting with applications to numerical problems. J. Comput. System Sci. 47 (1993), 549-595.
15. Bogdanov, A., Obata, K., and Trevisan, L., A lower bound for testing 3-colorability in bounded-degree graphs. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 2002, 93-102.
16. Coppersmith, D., Manuscript, 1989.
17. Ergün, F., Kannan, S., Kumar, S. R., Rubinfeld, R., and Viswanathan, M., Spot-checkers. J. Comput. System Sci. 60 (3) (2000), 717-751.
18. Ergün, F., Kumar, R., and Rubinfeld, R., Checking approximate computations of polynomials and functional equations. SIAM J. Comput 31 (2) (2001), 550-576.
19. Fischer, E., The art of uninformed decisions:A primer to property testing. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 75 (2001), 97-126.
20. Fischer, E., On the strength of comparisons in property testing. In Electronic Colloquium on Computational Complexity 8 (20), 2001.
21. Fischer, E., and Matsliah, A., Testing graph isomorphism. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York 2006, 299-308.
22. Goldreich, O., Combinatorial property testing - a survey. In Randomization Methods in Algorithm Design, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 43, Amer. Math. Soc., Providence, RI, 1999, 45-60.
23. Goldreich, O., Goldwasser, S., and Ron, D., Property testing and its connection to learning and approximation. J. ACM 45 (4) (1998), 653-750.
24. Goldreich, O., and Ron, D., On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity 7 (20), 2000.
25. Goldreich, O., and Ron, D., Property testing in bounded degree graphs. Algorithmica 32 (2002), 302-343.
26. Goldreich, O., and Trevisan, L., Three theorems regarding testing graph properties. In Proceedings of the 42nd Conference on Foundations of Computer Science, IEEE Computer Soc. Press, Los Alamitos, CA, 2001, 460-469.
27. Jutla, C. S., Patthak, A. C., Rudra, A., and Zuckerman, D., Testing low-degree polynomials over prime fields. In Proceedings of the 45th Annual Symposium on Foundations of Computer Science, IEEE Computer Soc. Press, Los Alamitos, CA, 2004, 423-432.
28. Kaufman, T., Krivelevich, M., Ron, D., Tight bounds for testing bipartiteness in general graphs. SIAM J. Comput. 33 (2004), 1441-1483.
29. Kaufman, T., and Ron, D., Testing polynomials over general fields. In Proceedings of the 45th Annual Symposium on Foundations of Computer Science, IEEE Computer Soc. Press, Los Alamitos, CA, 2004, 413-422.
30. Kiwi, M., Magniez, F., and Santha, M., Approximate testing with error relative to input size. J. Comput. System Sci. 66 (2) (2003), 371-392.
31. Parnas, M., and Ron, D., Testing the diameter of graphs. Random Structures Algorithms 20 (2) (2002), 165-183.
32. Polischuk, A., and Spielman, D., Nearly linear-size holographic proofs. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, ACM Press, New York 1994, 194-203.
33. Raskhodnikova, S., Ron, D., Rubinfeld, R., Shpilka, A., and Smith, A., Sublinear algorithms for string compressibility and the distribution support size. Electronic Colloquium on Computational Complexity 5 (125), 2005.
34. Raz, R., and Safra, S., A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, ACM Press, New York 1997, 475-484.
35. Ron, D., Property testing. In Handbook of randomized computing, Vol. II, Comb. Optim., Kluwer Acad. Publ., Dordrecht 2001, 597-649.
36. Rubinfeld, R., On the robustness of functional equations. SIAM J. Comput 28 (6) (1999), 1972-1997.
37. Rubinfeld, R., and Sudan, M., Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25 (2) (1996), 252-271.