
...consist of repeating a basic test for a number of times that depends on the proximity parameter, whereas the basic test is oblivious of the proximity parameter. we refer to such basic tests by the term proximityoblivious testers. while proximityoblivious testers were studied before { most...

...in the aforementioned models of testing graph properties, characterization by such invariant local conditions
is closely related to proximity oblivious testing (as defined by goldreich and...neither necessary nor sufficient for proximity
oblivious testing. furthermore, we show that easy...

...consist of repeating a basic test for a number of times that depends on the proximity parameter, whereas the basic test is oblivious of the proximity parameter. we refer to such basic tests by the term proximityoblivious testers. while proximityoblivious testers were studied before { most...


...an instance of {\em correlation testing}. in this framework, a fixed test is applied to a function, and the acceptance probability of the test is dependent on the correlation of the function from the property. this is an analog of {\em proximity oblivious testing}, a notion coined by goldreich...

...is an instance of correlation testing. in this framework, a fixed test is applied to a function, and the acceptance probability of the test is dependent on the correlation of the function from the property. this is an analog of proximity oblivious testing, a notion coined by goldreich...
Published in 2011.

...is a property of functions on $\f_n$ that is closed...in fact, we show a proximityoblivious test for any such property $p$ , meaning that there is a test that, given an input function...

...documents two programmatic comments regarding testing graph properties, which i made during the dagstuhl workshop
on sublineartime algorithms (july 2005...dependence of the tester’s
complexity on the proximity parameter. the second comment advocates...

...to the query complexity of testing graph properties in the adjacency...of properties that can be tested nonadaptively within complexity that is inversely proportional to the proximity parameter.
arguably, this is the...

...reader to the study of testing graph properties, while focusing on the main models
and issues...
Published in 2010.