Low-degree tests

A fast and simple randomized parallel algorithm for the maximal independent set problem

Journal of Algorithms

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 note on efficient zero-knowledge proofs and arguments (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

Two-prover one-round proof systems: their power and their problems (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

Highly resilient correctors for polynomials

Information Processing Letters

Efficient probabilistically checkable proofs and applications to approximations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Efficient checking of polynomials and proofs and the hardness of approximation problems

Efficient checking of polynomials and proofs and the hardness of approximation problems

Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)

Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation

On slightly superlinear transparent proofs

On slightly superlinear transparent proofs