Property testing is concerned with the design of super-fast algorithms for the structural
analysis of large quantities of data. The aim is to unveil global features of the data, such as …

We present a (randomized) test for monotonicity of Boolean functions. Namely, given the
ability to query an unknown function f:{0, 1}/sup n/-{0, 1} at arguments of its choice, the test …

The field of property testing studies algorithms that distinguish, using a small number of
queries, between inputs which satisfy a given property, and those that are'far'from satisfying …

In this paper we study a generalization of standard property testing where the algorithms are
required to be more tolerant with respect to objects that do not have, but are close to having …

Property testing is a new field in computational theory, that deals with the information that
can be deduced from the input where the number of allowable queries (reads from the input) …

Property testing algorithms are" ultra"-efficient algorithms that decide whether a given object
(eg, a graph) has a certain property (eg, bipartiteness), or is significantly different from any …

We develop a new technique for proving lower bounds in property testing, by showing a
strong connection between testing and communication complexity. We give a simple …

Sublinear Time Algorithms Page 1 Copyright © by SIAM. Unauthorized reproduction of this article
is prohibited. SIAM J. DISCRETE MATH. c 2011 Society for Industrial and Applied Mathematics …

We show that a boolean valued function over n variables, where each variable ranges in an
arbitrary probability space, can be tested for the property of depending on only J of them …

Given the ability to perform (local) queries concerning a particular object (eg, a function, or a
graph), the task is to determine whether the object has a predetermined (global) property …