Distribution-free connectivity testing

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

Volumn 3122, Issue , 2004, Pages 393-404

  Halevy, Shirley ^a   Kushilevitz, Eyal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; GRAPHIC METHODS; OPTIMIZATION;

BOUNDED DEGREE GRAPHS; DISTRIBUTION-FREE; DISTRIBUTION-FREE PROPERTY TESTING; GRAPH CONNECTIVITY; GRAPH PROPERTIES; PROPERTY-TESTING; TESTING ALGORITHM; UNIFORM DISTRIBUTION;

APPROXIMATION ALGORITHMS;

EID: 35048899252     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_35     Document Type: Article

References (19)

1. N. Alon, E. Fischer, M. Krivelevich, and M. szegedy, Efficient testing of large graphs. FOCS 1999, pp. 656-666.
2. M. Blum, M. Luby, and R. Rubinfeld, Seif testing/correcting with applications to numerical problems, Journal of Computer and System Sceince 47:549-595, 1993.
3. A. Bogdanov, K. Obata, and L. Trevisan, A lower bound for testing 3-colorability in bounded-degree graphs. FOCS 2002, pp. 93-102.
4. A. Czumaj and C. Sohler, Testing- hypergraph coloring, ICALP 2001, 493-505.
5. E. Ergün, S. Kannan, R. Kumar, R. Rubinfeld, and M. Viswanathan, Spotcheckers, Journal of Computing and System Science, 60:717-751, 2000 (a preliminary version appeared in STOC 1998).
6. 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.
7. O. Goldreich, Combinatorial property testing - a survey, In: Randomized Methods in Algorithms Design (P. Pardalos, S. Rajasekaran and J. Rolim eds.), AMSDIMACS pages 45-61, 1998.
8. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, and A. Samorodnitsky, Testing Monotonicity, Combinatorica, 20(3):301-337, 2000 (a preliminary version appeared in FOCS 1998).
9. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, Journal of the ACM, 45(4):653-750, 1998 (a preliminary version appeared in FOCS 1996).
10. O. Goldreich and D. Ron, On testing expansion in bounded-degree graphs. In Electronic Colloquium on Computational Complexity 7(20), 2000.
11. O. Goldreich and D. Ron, Property testing in bounded-degree graphs. STOC 1997, pp. 406-415.
12. O. Goldreich and L. Trevisan, Three theorems regarding testing graph properties. FOCS 2001, pp. 302-317.
13. S. Halevy and E. Kushilevitz, Distribution-free property testing. RANDOMAPPROX 2003, pp. 341-353.
14. S. Halevy and E. Kushilevitz, Testing monotonicity over graph products. To appear in ICALP 2004.
15. T. Kaufman, M. Krivelevich, and D. Ron, Tight bounds for testing bipartiteness in general graphs. RANDOM-APPROX 2003, pp. 341-353.
16. Y. Kohayakawa, B. Nagle, and V. Rodl, Efficient testing of hypergraphs. ICALP 2002, pp. 1017-1028.
17. M. Parnas, and D. Ron, Testing the diameter of graphs, RANDOM-APPROX 1999, pp.85-96.
18. D. Ron, Property testing (a tutorial), In: Handbook of Randomized Computing (S.Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolin eds), Kluwer Press (2001).
19. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM Journal of Computing, 25(2):252-271, 1996. (first appeared as a technical report, Cornell University, 1993).