|
371
|
Property Testing and its connection to Learning and Approximation
– Oded Goldreich, Shafi Goldwasser, Dana Ron
|
|
107
|
Property Testing in Bounded Degree Graphs
– Oded Goldreich, Dana Ron
- 1997
|
|
14
|
Estimating the weight of metric minimum spanning trees in sublinear-time
– Artur Czumaj, Christian Sohler
|
|
11
|
Sublinear-Time Approximation of Euclidean Minimum Spanning Tree
– Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
- 2003
|
|
282
|
Robust Characterizations of Polynomials with Applications to Program Testing
– Ronitt Rubinfeld, Madhu Sudan
- 1996
|
|
68
|
Sublinear Time Algorithms for Metric Space Problems
– Piotr Indyk
|
|
141
|
Efficient Testing of Large Graphs
– Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
|
|
51
|
Testing of Clustering
– Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
- 2000
|
|
29
|
Tight bounds for testing bipartiteness in general graphs
– Tali Kaufman, Michael Krivelevich, Dana Ron
|
|
7
|
Approximating Average Parameters of Graphs
– O Goldreich, D Ron
- 2008
|
|
108
|
The art of uninformed decisions: A primer to property testing
– Eldar Fischer
- 2001
|
|
41
|
Combinatorial Property Testing (a survey)
– Oded Goldreich
- 1998
|
|
69
|
A sublinear bipartite tester for bounded degree graphs
– Oded Goldreich, Dana Ron
- 1999
|
|
38
|
Sublinear Time Approximate Clustering
– Nina Mishra, Dan Oblinger, Leonard Pitt
- 2001
|
|
47
|
Testing K-Colorability
– Noga Alon, Michael Krivelevich
- 1999
|
|
298
|
Self-Testing/Correcting with Applications to Numerical Problems
– Manuel Blum, Michael Luby, Ronitt Rubinfeld
- 1990
|
|
27
|
A lower bound for testing 3-colorability in bounded-degree graphs
– Andrej Bogdanov, Kenji Obata, Luca Trevisan
- 2002
|
|
77
|
A characterization of the (natural) graph properties testable with one-sided error
– Noga Alon, Asaf Shapira
- 2005
|
|
26
|
Property testing in computational geometry
– A Czumaj, C Sohler, M Ziegler
- 2000
|
