Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The algorithmic aspects of the regularity lemma
Journal of Algorithms
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Extremal problems on set systems
Random Structures & Algorithms
Efficient Testing of Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Regularity lemma for k-uniform hypergraphs
Random Structures & Algorithms
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An Algorithmic Version of the Hypergraph Regularity Method
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Additive Approximation for Edge-Deletion Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Applications of the regularity lemma for uniform hypergraphs
Random Structures & Algorithms
The counting lemma for regular k-uniform hypergraphs
Random Structures & Algorithms
A combinatorial characterization of the testable graph properties: it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Graph limits and parameter testing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A variant of the hypergraph removal lemma
Journal of Combinatorial Theory Series A
Every Monotone $3$-Graph Property is Testable
SIAM Journal on Discrete Mathematics
Indistinguishability and first-order logic
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Relational properties expressible with one universal quantifier are testable
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
A note on the testability of ramsey's class
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
Property testers are efficient, randomized algorithms which recognize if an input graph (or other combinatorial structure) satisfies a given property or if it is "far" from exhibiting it.Generalizing several earlier results, Alon and Shapira showed thathereditary graph properties are testable (with one-sided error). In this paper we prove the analogous result for hypergraphs.This result is an immediate consequence of a (hyper)graph theoretic statement, which is an extension of the so-called removal lemma. The proof of this generalization relies on the regularity method for hypergraphs.