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
Software reliability via run-time result-checking
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A sublinear bipartiteness tester for bounded degree graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Testing problems with sub-learning sample complexity
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximate testing with relative error
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Self-testing of universal and fault-tolerant sets of quantum gates
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Testing graphs for colorable properties
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Monotonicity testing over general poset domains
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Testing the diameter of graphs
Random Structures & Algorithms
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
Property testers for dense constraint satisfaction programs on finite domains
Random Structures & Algorithms
Testing membership in parenthesis languages
Random Structures & Algorithms
Property testing of data dimensionality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
Approximating the Minimum Spanning Tree Weight in Sublinear Time
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Multi-linearity Self-Testing with Relative Error
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Small PCPs with Low Query Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Hunting for Functionally Analogous Genes
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Proclaiming Dictators and Juntas or Testing Boolean Formulae
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On Testing Convexity and Submodularity
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
omega-Regular Languages Are Testable with a Constant Number of Queries
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Property Testing in Computational Geometry
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Property testing in massive graphs
Handbook of massive data sets
Some 3CNF properties are hard to test
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algebraic testing and weight distributions of codes
Theoretical Computer Science
Approximate testing with error relative to input size
Journal of Computer and System Sciences
Efficient Testing of Large Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Functions that have read-once branching programs of quadratic size are not necessarily testable
Information Processing Letters
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Three theorems regarding testing graph properties
Random Structures & Algorithms
Algorithms column: sublinear time algorithms
ACM SIGACT News
Information and Computation
On the strength of comparisons in property testing
Information and Computation
A characterization of easily testable induced subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Fast approximate probabilistically checkable proofs
Information and Computation
Functions that have read-twice constant width branching programs are not necessarily testable
Random Structures & Algorithms
Robust pcps of proximity, shorter pcps and applications to coding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The difficulty of testing for isomorphism against a graph that is given in advance
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Derandomizing homomorphism testing in general groups
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A lower bound for testing juntas
Information Processing Letters
Journal of Computer and System Sciences - Special issue on FOCS 2002
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Simple PCPs with poly-log rate and query complexity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing hypergraph colorability
Theoretical Computer Science - Automata, languages and programming
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
ω-Regular languages are testable with a constant number of queries
Theoretical Computer Science
Linear equations, arithmetic progressions and hypergraph property testing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Conformance testing in the presence of multiple faults
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A large lower bound on the query complexity of a simple boolean function
Information Processing Letters
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
Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Sub-constant error low degree test of almost-linear size
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Robust locally testable codes and products of codes
Random Structures & Algorithms
Locally testable codes and PCPs of almost-linear length
Journal of the ACM (JACM)
Tolerant property testing and distance approximation
Journal of Computer and System Sciences
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
Lower bounds for testing Euclidean Minimum Spanning Trees
Information Processing Letters
Property testing in hypergraphs and the removal lemma
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Probabilistic abstraction for model checking: An approach based on property testing
ACM Transactions on Computational Logic (TOCL)
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Theoretical Computer Science
Estimating the distance to a monotone function
Random Structures & Algorithms
Quantum Algorithms for Learning and Testing Juntas
Quantum Information Processing
Parallel monotonicity reconstruction
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms (TALG)
Robust methods for databases and robotics
ISPRA'05 Proceedings of the 4th WSEAS International Conference on Signal Processing, Robotics and Automation
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
Sketching in adversarial environments
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Testing monotonicity over graph products
Random Structures & Algorithms
Space Complexity Vs. Query Complexity
Computational Complexity
Approximate schemas, source-consistency and query answering
Journal of Intelligent Information Systems
Improved Bounds for Testing Juntas
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On the Query Complexity of Testing Orientations for Being Eulerian
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Testing whether a digraph contains H-free k-induced subgraphs
Theoretical Computer Science
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the Randomness Complexity of Property Testing
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Attribute estimation and testing quasi-symmetry
Information Processing Letters
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
On proximity oblivious testing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Testing juntas nearly optimally
Proceedings of the forty-first annual ACM symposium on Theory of computing
Green's conjecture and testing linear-invariant properties
Proceedings of the forty-first annual ACM symposium on Theory of computing
An improved constant-time approximation algorithm for maximum~matchings
Proceedings of the forty-first annual ACM symposium on Theory of computing
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
A Hypergraph Dictatorship Test with Perfect Completeness
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Hierarchy Theorems for Property Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Algorithmic Aspects of Property Testing in the Dense Graphs Model
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Succinct Representation of Codes with Applications to Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Tolerant Linearity Testing and Locally Testable Codes
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Testing Computability by Width Two OBDDs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Application of ε -testers algorithms under sketch calculation model in robot navigation problem
ICS'09 Proceedings of the 13th WSEAS international conference on Systems
Approximate Structural Consistency
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A large lower bound on the query complexity of a simple boolean function
Information Processing Letters
Application of Ɛ-testers algorithms under sketch and streaming calculation model in robot navigation
WSEAS Transactions on Computers
Periodicity testing with sublinear samples and space
ACM Transactions on Algorithms (TALG)
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Two-query PCP with subconstant error
Journal of the ACM (JACM)
Testing convexity properties of tree colorings
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Property testing: a learning theory perspective
COLT'07 Proceedings of the 20th annual conference on Learning theory
Indistinguishability and first-order logic
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Approximating the distance to monotonicity in high dimensions
ACM Transactions on Algorithms (TALG)
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing
Distributed discovery of large near-cliques
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Relational properties expressible with one universal quantifier are testable
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Property testing and parameter testing for permutations
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lower bounds for testing triangle-freeness in Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Testing non-uniform k-wise independent distributions over product spaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
Distribution-free testing algorithms for monomials with a sublinear number of queries
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
Testing outerplanarity of bounded degree graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Local graph exploration and fast property testing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
SIAM Journal on Computing
Approximate Satisfiability and Equivalence
SIAM Journal on Computing
Local Monotonicity Reconstruction
SIAM Journal on Computing
Guest column: testing linear properties: some general theme
ACM SIGACT News
A brief introduction to property testing
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Introduction to testing graph properties
Property testing
Transitive-closure spanners: a survey
Property testing
Invariance in property testing
Property testing
Testing linear-invariant non-linear properties: a short report
Property testing
Optimal Testing of Reed-Muller Code
Property testing
Hierarchy theorems for property testing
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Property testing
Symmetric LDPC codes and local testing
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Local property reconstruction and monotonicity
Property testing
Green's conjecture and testing linear invariant properties
Property testing
Robust methods for databases and robotics
SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
A brief introduction to property testing
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Introduction to testing graph properties
Property testing
Transitive-closure spanners: a survey
Property testing
Invariance in property testing
Property testing
Testing linear-invariant non-linear properties: a short report
Property testing
Optimal Testing of Reed-Muller Code
Property testing
Hierarchy theorems for property testing
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Property testing
Symmetric LDPC codes and local testing
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Local property reconstruction and monotonicity
Property testing
Green's conjecture and testing linear invariant properties
Property testing
Testing permutation properties through subpermutations
Theoretical Computer Science
Every property of hyperfinite graphs is testable
Proceedings of the forty-third annual ACM symposium on Theory of computing
Untestable properties in the kahr-moore-wang class
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
On the average-case complexity of property testing
Studies in complexity and cryptography
Studies in complexity and cryptography
Proximity oblivious testing and the role of invariances
Studies in complexity and cryptography
Short locally testable codes and proofs
Studies in complexity and cryptography
On the complexity of computational problems regarding distributions
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
Characterizations of locally testable linear-and affine-invariant families
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On sums of locally testable affine invariant properties
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Limits on the rate of locally testable affine-invariant codes
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
On approximating the number of relevant variables in a function
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
Characterizations of locally testable linear- and affine-invariant families
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
ICDT'07 Proceedings of the 11th international conference on Database Theory
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Finding frequent patterns in a string in sublinear time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Testing computability by width-two OBDDs
Theoretical Computer Science
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
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
The tensor product of two codes is not necessarily robustly testable
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
Self-testing of quantum circuits
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Information theory in property testing and monotonicity testing in higher dimension
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Property-Preserving data reconstruction
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the query complexity of testing orientations for being Eulerian
ACM Transactions on Algorithms (TALG)
Property testing and the branching program size of boolean functions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Guest column: algebraic construction of projection PCPs
ACM SIGACT News
Space complexity vs. query complexity
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Untestable properties expressible with four first-order quantifiers
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Theoretical Computer Science
Testing computability by width-2 OBDDs where the variable order is unknown
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Self-correctors for cryptographic modules
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Approximating and testing k-histogram distributions in sub-linear time
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Testable and untestable classes of first-order formulae
Journal of Computer and System Sciences
Sketching in Adversarial Environments
SIAM Journal on Computing
Testing Symmetric Properties of Distributions
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Property testing in sparse directed graphs: strong connectivity and subgraph-freeness
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
New affine-invariant codes from lifting
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Testing Closeness of Discrete Distributions
Journal of the ACM (JACM)
Testing the lipschitz property over product distributions with applications to data privacy
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Every locally characterized affine-invariant property is testable
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Testing subdivision-freeness: property testing meets structural graph theory
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
On Approximating the Number of Relevant Variables in a Function
ACM Transactions on Computation Theory (TOCT)
An algebraic characterization of testable boolean CSPs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Testing linear-invariant function isomorphism
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Testing consistency of quartet topologies: A parameterized approach
Information Processing Letters
Locally testable codes and cayley graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
Partial tests, universal tests and decomposability
Proceedings of the 5th conference on Innovations in theoretical computer science
High dimensional expanders and property testing
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.01 |
The study of self-testing and self-correcting programs leads to the search for robust characterizations of functions. Here the authors make this notion precise and show such a characterization for polynomials. From this characterization, the authors get the following applications. Simple and efficient self-testers for polynomial functions are constructed. The characterizations provide results in the area of coding theory by giving extremely fast and efficient error-detecting schemes for some well-known codes. This error-detection scheme plays a crucial role in subsequent results on the hardness of approximating some NP-optimization problems.