Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems
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
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A mathematical theory of self-checking, self-testing and self-correcting programs
A mathematical theory of self-checking, self-testing and self-correcting programs
Self-testing polynomial functions efficiently and over rational domains
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Checking approximate computations over the reals
STOC '93 Proceedings of the twenty-fifth 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
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Nearly-linear size holographic proofs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Designing programs that check their work
Journal of the ACM (JACM)
Testing multivariate linear functions: overcoming the generator bottleneck
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Reflections on the Pentium Division Bug
IEEE Transactions on Computers
Testing of the long code and hardness for clique
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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 sublinear bipartiteness tester for bounded degree graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Recycling queries in PCPs and in linearity tests (extended abstract)
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)
Approximate testing with relative error
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the Robustness of Functional Equations
SIAM Journal on 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
Self-Testing without the Generator Bottleneck
SIAM Journal on Computing
Sublinear time approximate clustering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
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
Testing the Diameter of Graphs
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
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
Linearity testing in characteristic two
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
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
Testing of function that have small width branching programs
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Approximate checking of polynomials and functional equations
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Property testing and its connection to learning and approximation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Probabilistically checkable proofs and the testing of hadamard-like codes
Probabilistically checkable proofs and the testing of hadamard-like codes
Nondeterministic exponential time has two-prover interactive protocols
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Probabilistic checking of proofs; a new characterization of NP
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
On the robustness of functional equations
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Property Testing
Noisy Chinese remaindering in the Lee norm
Journal of Complexity - Special issue on coding and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Local decoding and testing for homomorphisms
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
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Property testing for cyclic groups and beyond
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
In the late 80's Blum, Luby, Rubinfeld, Kannan et al. pioneered the theory of self-testing as an alternative way of dealing with the problem of software reliability. Over the last decade this theory played a crucial role in the construction of probabilistically checkable proofs and the derivation of hardness of approximation results. Applications in areas like computer vision, machine learning, and self-correcting programs were also established.In the self-testing problem one is interested in determining (maybe probabilistically) whether a function to which one has oracle access satisfies a given property. We consider the problem of testing algebraic functions and survey over a decade of research in the area. Special emphasis is given to illustrate the scenario where the problem takes place and to the main techniques used in the analysis of tests. A novel aspect of this work is the separation it advocates between the mathematical and algorithmic issues that arise in the theory of self-testing.