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 scheme for r...
We present a framework for property testing where a partially ordered execution trace of a distributed system is modeled by a collection of communicating automata. We prove that th...
Hesham Hallal, Sergiy Boroday, Andreas Ulrich, Ale...
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
—Property testing is a rapidly growing field of research. Typically, a property testing algorithm proceeds by quickly determining whether an input can satisfy some condition, und...
Igor Kleiner, Daniel Keren, Ilan Newman, Oren Ben-...
This paper presents the limit laws of discrepancies defined via exponential sums, and algorithms (with error bounds) to approximate the corresponding distribution functions. The re...