Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Coherent functions and program checkers
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
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
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
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
A minimal model for secure computation (extended abstract)
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
Private information storage (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Commodity-based cryptography (extended abstract)
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)
Protecting data privacy in private information retrieval schemes
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Universal service-providers for database private information retrieval (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Approximate testing with relative error
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Improved upper bounds on information-theoretic private information retrieval (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
One-way functions are essential for single-server private information retrieval
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
Reliable benchmarks using numerical instability
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
Selective private function evaluation with applications to private statistics
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Information-Theoretic Private Information Retrieval: A Unified Construction
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
List Decoding: Algorithms and Applications
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Using nondeterminism to amplify hardness
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
| Hi-index | 0.00 |