Distribution-Free Property-Testing
暂无分享,去创建一个
[1] Noga Alon,et al. Testing subgraphs in directed graphs , 2003, STOC '03.
[2] Ronitt Rubinfeld,et al. Monotonicity testing over general poset domains , 2002, STOC '02.
[3] Noga Alon,et al. Every monotone graph property is testable , 2005, STOC '05.
[4] Eldar Fischer,et al. Testing of matrix properties , 2001, STOC '01.
[5] Ronitt Rubinfeld,et al. Spot-checkers , 1998, STOC '98.
[6] Dana Ron,et al. Testing the diameter of graphs , 1999, RANDOM-APPROX.
[7] Noga Alon,et al. Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.
[8] Yoshiharu Kohayakawa,et al. Efficient Testing of Hypergraphs , 2002, ICALP.
[9] Noga Alon,et al. Testing triangle-freeness in general graphs , 2006, SODA '06.
[10] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[11] Noga Alon,et al. Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[12] E. Fischer. THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .
[13] Eldar Fischer. On the strength of comparisons in property testing , 2004, Inf. Comput..
[14] Umesh V. Vazirani,et al. An Introduction to Computational Learning Theory , 1994 .
[15] Noga Alon,et al. A characterization of easily testable induced subgraphs , 2004, SODA '04.
[16] Noga Alon,et al. A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[17] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 2002, STOC '97.
[18] Eyal Kushilevitz,et al. A Lower Bound for Distribution-Free Monotonicity Testing , 2005, APPROX-RANDOM.
[19] Dana Ron,et al. Proclaiming Dictators and Juntas or Testing Boolean Formulae , 2001, RANDOM-APPROX.
[20] Guy Kindler,et al. Testing juntas , 2002, J. Comput. Syst. Sci..
[21] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[22] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[23] Oded Goldreich,et al. Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.
[24] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[25] Dana Ron,et al. Testing Monotonicity , 2000, Comb..
[26] Noga Alon,et al. Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[27] Dana Ron,et al. Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[28] Noga Alon,et al. Testing of Clustering , 2003, SIAM J. Discret. Math..
[29] Ilan Newman. Testing of function that have small width branching programs , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[30] Seshadhri Comandur,et al. Testing Expansion in Bounded Degree Graphs , 2007, Electron. Colloquium Comput. Complex..
[31] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[32] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.
[33] Dana Ron,et al. Testing metric properties , 2003, Inf. Comput..
[34] Ronitt Rubinfeld,et al. Testing Parenthesis Languages , 2001, RANDOM-APPROX.
[35] Bernard Chazelle,et al. Information theory in property testing and monotonicity testing in higher dimension , 2005, Inf. Comput..
[36] Eyal Kushilevitz,et al. Testing Monotonicity over Graph Products , 2004, ICALP.
[37] Kenji Obata,et al. A lower bound for testing 3-colorability in bounded-degree graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[38] D. Ron,et al. Testing membership in parenthesis languages , 2003, Random Struct. Algorithms.
[39] Luca Trevisan,et al. Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..
[40] Dana Ron,et al. Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..
[41] Dana Ron,et al. Tight Bounds for Testing Bipartiteness in General Graphs , 2004, RANDOM-APPROX.
[42] Artur Czumaj,et al. Testing Hypergraph Coloring , 2001, ICALP.