Communications of the ACM
Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Lectures on statistical inference
Lectures on statistical inference
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
The algorithmic aspects of the regularity lemma
Journal of Algorithms
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A Fast Algorithm for Optimally Increasing the Edge Connectivity
SIAM Journal on Computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Testing problems with sublearning sample complexity
Journal of Computer and System Sciences
Monotonicity testing over general poset domains
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Regular Languages are Testable with a Constant Number of Queries
SIAM Journal on Computing
Testing Membership in Languages that Have Small Width Branching Programs
SIAM Journal on Computing
Testing Basic Boolean Formulae
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics
Testing the diameter of graphs
Random Structures & Algorithms
Testing membership in parenthesis languages
Random Structures & Algorithms
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Efficient Testing of Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improved Testing Algorithms for Monotonicity
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
SIAM Journal on Discrete Mathematics
A sublinear algorithm for weakly approximating edit distance
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Testing that distributions are close
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Functions that have read-once branching programs of quadratic size are not necessarily testable
Information Processing Letters
Journal of Algorithms
Testing Random Variables for Independence and Identity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Some improvements to total degree tests
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Three theorems regarding testing graph properties
Random Structures & Algorithms
Algorithms column: sublinear time algorithms
ACM SIGACT News
Information and Computation
Functions that have read-twice constant width branching programs are not necessarily testable
Random Structures & Algorithms
Sublinear algorithms for testing monotone and unimodal distributions
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Lower Bounds for Testing Bipartiteness in Dense Graphs
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
A lower bound for testing juntas
Information Processing Letters
Journal of Computer and System Sciences - Special issue on FOCS 2002
Tight Bounds for Testing Bipartiteness in General Graphs
SIAM Journal on Computing
Testing Low-Degree Polynomials over Prime Fields
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Abstract Combinatorial Programs and Efficient Property Testers
SIAM Journal on Computing
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing monotone high-dimensional distributions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Testing graphs for colorability properties
Random Structures & Algorithms
Some 3CNF Properties Are Hard to Test
SIAM Journal on Computing
The Complexity of Approximating the Entropy
SIAM Journal on Computing
Almost Orthogonal Linear Codes are Locally Testable
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
Testing triangle-freeness in general graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Tolerant property testing and distance approximation
Journal of Computer and System Sciences
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
Information theory in property testing and monotonicity testing in higher dimension
Information and Computation
Testing Polynomials over General Fields
SIAM Journal on Computing
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Testing Properties of Constraint-Graphs
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Testing versus Estimation of Graph Properties
SIAM Journal on Computing
Testing for Concise Representations
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Testing Expansion in Bounded-Degree Graphs
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Comparing the strength of query types in property testing: the case of testing k-colorability
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Distribution-Free Property-Testing
SIAM Journal on Computing
Testing symmetric properties of distributions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Conductance and convergence of Markov chains-a combinatorial treatment of expanders
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Efficiently Testing Sparse GF(2) Polynomials
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
An Expansion Tester for Bounded Degree Graphs
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Property Testing on k-Vertex-Connectivity of Graphs
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Approximating the distance to properties in bounded-degree and general sparse graphs
ACM Transactions on Algorithms (TALG)
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Testing juntas nearly optimally
Proceedings of the forty-first annual ACM symposium on Theory of computing
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
SIAM Journal on Computing
Fast approximate PCPs for multidimensional bin-packing problems
Information and Computation
Local Graph Partitions for Approximation and Testing
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Approximating the distance to monotonicity in high dimensions
ACM Transactions on Algorithms (TALG)
Tolerant locally testable codes
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
A lower bound for distribution-free monotonicity testing
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Property testing and the branching program size of boolean functions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Linearity testing in characteristic two
IEEE Transactions on Information Theory - Part 1
IEEE Transactions on Information Theory
Testing Boolean function isomorphism
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On testing computability by small width OBDDs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Guest column: testing linear properties: some general theme
ACM SIGACT News
Sorting and selection on dynamic data
Theoretical Computer Science
A brief introduction to property testing
Property testing
Introduction to testing graph properties
Property testing
Hierarchy theorems for property testing
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
A brief introduction to property testing
Property testing
Introduction to testing graph properties
Property testing
Hierarchy theorems for property testing
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Untestable properties in the kahr-moore-wang class
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Lower bounds for testing computability by small width OBDDs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On the average-case complexity of property testing
Studies in complexity and cryptography
Proximity oblivious testing and the role of invariances
Studies in complexity and cryptography
A brief introduction to property testing
Studies in complexity and cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
Another motivation for reducing the randomness complexity of algorithms
Studies in complexity and cryptography
Proximity oblivious testing and the role of invariances
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Algorithmic Aspects of Property Testing in the Dense Graphs Model
SIAM Journal on Computing
On Proximity-Oblivious Testing
SIAM Journal on Computing
An Expansion Tester for Bounded Degree Graphs
SIAM Journal on Computing
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Testing computability by width-two OBDDs
Theoretical Computer Science
Testing the (s,t)-disconnectivity of graphs and digraphs
Theoretical Computer Science
Testable and untestable classes of first-order formulae
Journal of Computer and System Sciences
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Every locally characterized affine-invariant property is testable
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Interactive proofs of proximity: delegating computation in sublinear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Testing linear-invariant function isomorphism
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
Partial tests, universal tests and decomposability
Proceedings of the 5th conference on Innovations in theoretical computer science
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |
Property testing algorithms are "ultra"-efficient algorithms that decide whether a given object (e.g., a graph) has a certain property (e.g., bipartiteness), or is significantly different from any object that has the property. To this end property testing algorithms are given the ability to perform (local) queries to the input, though the decision they need to make usually concerns properties with a global nature. In the last two decades, property testing algorithms have been designed for many types of objects and properties, amongst them, graph properties, algebraic properties, geometric properties, and more. In this monograph we survey results in property testing, where our emphasis is on common analysis and algorithmic techniques. Among the techniques surveyed are the following: The self-correcting approach, which was mainly applied in the study of property testing of algebraic properties; The enforce-and-test approach, which was applied quite extensively in the analysis of algorithms for testing graph properties (in the dense-graphs model), as well as in other contexts; Szemerédi's Regularity Lemma, which plays a very important role in the analysis of algorithms for testing graph properties (in the dense-graphs model); The approach of Testing by implicit learning, which implies efficient testability of membership in many functions classes; and Algorithmic techniques for testing properties of sparse graphs, which include local search and random walks.