Suppose someone gives us an extremely fast program P that we can call as a black box to compute a function f Should we trust that P works correctly A self testing correcting pair for f allows us toâ€¦ (More)

The study of self-testing and self-correcting programs leads to the search for robust characterizations of functions. Here we make this notion precise and show such a characterization forâ€¦ (More)

We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction generalizes the classicalâ€¦ (More)

Given two distributions over anelement set, we wish to check whether these distributions are statistically close by only sampling. We give a sublinear algorithm which uses O(n âˆ’4 log n) independentâ€¦ (More)

Given a function f mapping n-variate inputs from a finite field F into F , we consider the task of reconstructing a list of all n-variate degree d polynomials which agree with f on a tiny butâ€¦ (More)

On Labor Day Weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from dr iving incorrectly. We explore aâ€¦ (More)

Given access to independent samples of a distribution A over [nâ„„ [mâ„„, we show how to test whether the distributions formed by projecting A to each coordinate are independent, i.e., whether A isâ€¦ (More)

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 theâ€¦ (More)

We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give theâ€¦ (More)