On the hardness of computing the permanent of random matrices (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Self-testing polynomial functions efficiently and over rational domains
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A taxonomy of proof systems (part 1)
ACM SIGACT News
Checking approximate computations over the reals
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A taxonomy of proof systems (part 2)
ACM SIGACT News
Nearly-linear size holographic proofs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
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
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On the efficiency of local decoding procedures for error-correcting codes
STOC '00 Proceedings of the thirty-second 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
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Certification of Computational Results
IEEE Transactions on Computers
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
Self-Testing/Correcting Protocols (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Multi-linearity Self-Testing with Relative Error
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Interactive Proofs with Space Bounded Provers
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
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 massive graphs
Handbook of massive data sets
Exponential lower bound for 2-query locally decodable codes via a quantum argument
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
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fast approximate probabilistically checkable proofs
Information and Computation
Average-case intractability vs. worst-case intractability
Information and Computation
Functions that have read-twice constant width branching programs are not necessarily testable
Random Structures & Algorithms
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Almost Orthogonal Linear Codes are Locally Testable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Lower bounds for adaptive locally decodable codes
Random Structures & Algorithms
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Local Monotonicity Reconstruction
SIAM Journal on Computing
Short locally testable codes and proofs: a survey in two parts
Property testing
Local property reconstruction and monotonicity
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Local property reconstruction and monotonicity
Property testing
Short locally testable codes and proofs
Studies in complexity and cryptography
Hard functions for low-degree polynomials over prime fields
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Self-correctors for cryptographic modules
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
k-Concealment: An Alternative Model of k-Type Anonymity
Transactions on Data Privacy
Private locally decodable codes
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
New affine-invariant codes from lifting
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Hard Functions for Low-Degree Polynomials over Prime Fields
ACM Transactions on Computation Theory (TOCT)
Local correctability of expander codes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.01 |