A combinatorial characterization of the testable graph properties
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
Every Monotone Graph Property Is Testable
Testing Odd-Cycle-Freeness in Boolean Functions
A Unified Framework for Testing Linear-Invariant Properties
Sublinear Time Algorithms
SIAM Journal on Computing
Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC ’09
Combinatorics, Probability and Computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC ’06
SIAM Journal on Discrete Mathematics
2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Arnab Bhattacharyya
Noga Alon
ELENA GRIGORESCU
Ronitt Rubinfeld
Prasad Raghavendra
Guest column