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 …

For an n-vertex digraph G=(V, E), a shortcut set is a (small) subset of edges H taken from the
transitive closure of G that, when added to G guarantees that the diameter of G∪ H is small …

A function f:D→R is Lipschitz if d_R(f(x),f(y))≦d_D(x,y) for all x,y in D, where d_R and d_D
denote the distance metrics on the range and domain of f, respectively. We initiate the study …

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 …

This book introduces important results and techniques in property testing, where the goal is
to design algorithms that decide whether their input satisfies a predetermined property in …

We formalize the problem of selecting the optimal set of options for planning as that of
computing the smallest set of options so that planning converges in less than a given …

We show that every algorithm for testing n-variate Boolean functions for monotonicityhas
query complexity Ω (n 1/4). All previous lower bounds for this problem were designed for …

We design a nonadaptive algorithm that, given oracle access to a function which is‐far from
monotone, makes poly queries and returns an estimate that, with high probability, is an …

It was recently shown that a version of the greedy algorithm gives a construction of fault-
tolerant spanners that is size-optimal, at least for vertex faults. However, the algorithm to …

We study the problem of monotonicity testing over the hypercube. As previously observed in
several works, a positive answer to a natural question about routing properties of the …