The problem of monotonicity testing over the hypergrid and its special case, the hypercube,
is a classic question in property testing. We are given query access to f:[k] n-> R (for some …

We initiate a systematic study of sublinear algorithms for approximately testing properties of
real-valued data with respect to L p distances for p= 1, 2. Such algorithms distinguish …

We show how the communication complexity method introduced in (Blais, Brody, Matulef
2012) can be used to prove lower bounds on the number of queries required to test …

The primary problem in property testing is to decide whether a given function satisfies a
certain property or is far from any function satisfying it. This crucially requires a notion of …

We study the problem of testing unateness of functions $ f:\{0, 1\}^ d\to\mathbb {R}. $ We
give a $ O (\frac {d}{\epsilon}\cdot\log\frac {d}{\epsilon}) $-query nonadaptive tester and a …

We consider properties of edge-colored vertex-ordered graphs-graphs with a totally ordered
vertex set and a finite set of possible edge colors-showing that any hereditary property of …

We introduce a test for the conditional independence of random variables $ X $ and $ Y $
given a random variable $ Z $, specifically by sampling from the joint distribution $(X, Y, Z) …

We present online algorithms for directed spanners and Steiner forests. These problems fall
under the unifying framework of online covering linear programming formulations …

In the past few years, the focus of research in the area of statistical data privacy has been in
designing algorithms for various problems which satisfy some rigorous notions of privacy …

Property testers form an important class of sublinear-time algorithms. In the standard
property testing model, an algorithm accesses the input function f:D↦\calR via an oracle …