Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Omri Ben-Eliezer:

TR18-196 | 19th November 2018
Omri Ben-Eliezer

Testing local properties of arrays

We study testing of local properties in one-dimensional and multi-dimensional arrays. A property of $d$-dimensional arrays $f:[n]^d \to \Sigma$ is $k$-local if it can be defined by a family of $k \times \ldots \times k$ forbidden consecutive patterns. This definition captures numerous interesting properties. For example, monotonicity, Lipschitz continuity and ... more >>>

TR18-021 | 30th January 2018
Omri Ben-Eliezer, Eldar Fischer

Earthmover Resilience and Testing in Ordered Structures

One of the main challenges in property testing is to characterize those properties that are testable with a constant number of queries. For unordered structures such as graphs and hypergraphs this task has been mostly settled. However, for ordered structures such as strings, images, and ordered graphs, the characterization problem ... more >>>

TR17-058 | 7th April 2017
Noga Alon, Omri Ben-Eliezer, Eldar Fischer

Testing hereditary properties of ordered graphs and matrices

Revisions: 1

We consider properties of edge-colored vertex-ordered graphs, i.e., graphs with a totally ordered vertex set and a finite set of possible edge colors. We show that any hereditary property of such graphs is strongly testable, i.e., testable with a constant number of queries.
We also explain how the proof can ... more >>>

ISSN 1433-8092 | Imprint