论文信息 - Combinatorial Property Testing - 字舞流文

Combinatorial Property Testing

Abhiram G. Ranade

[1] Luca Trevisan,et al. Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..

[2] Bernard Chazelle,et al. Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.

[3] Dana Ron,et al. Tight Bounds for Testing Bipartiteness in General Graphs , 2004, SIAM J. Comput..

[4] E. Fischer. THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[5] Ronitt Rubinfeld,et al. Spot-checkers , 1998, STOC '98.

[6] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.

[7] Noga Alon,et al. A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

[8] Noga Alon,et al. Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[9] Eldar Fischer. On the strength of comparisons in property testing , 2004, Inf. Comput..

[10] N. Alon,et al. Testing triangle-freeness in general graphs , 2006, SODA 2006.