Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Hiding instances in multioracle queries
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Small-bias probability spaces: efficient constructions and applications
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
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Fully parallelized multi prover protocols for NEXP-time (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On the complexity of approximating the independent set problem
Information and Computation
Constructing small sample spaces satisfying given constraints
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Two prover protocols: low error at affordable rates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Nondeterministic exponential time has two-prover interactive protocols
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
On the second eigenvalue and linear expansion of regular graphs
SFCS '92 Proceedings of the 33rd 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
Two prover protocols: low error at affordable rates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient probabilistic checkable proofs and applications to approximation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomized graph products, chromatic numbers, and Lovasz j-function
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the hardness of approximating optimum schedule problems in store and forward networks
IEEE/ACM Transactions on Networking (TON)
Testing of the long code and hardness for clique
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Recycling queries in PCPs and in linearity tests (extended abstract)
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
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Better methods for solving parsimony and compatibility
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Finding subsets maximizing minimum structures
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
On point covers of c-oriented polygons
Theoretical Computer Science
Some optimal inapproximability results
Journal of the ACM (JACM)
Approximation algorithms for general parallel task scheduling
Information Processing Letters
Improved approximations of independent sets in bounded-degree graphs via subgraph removal
Nordic Journal of Computing
Hard graphs for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE
Nordic Journal of Computing
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
Clique Is Hard to Approximate within n1-o(1)
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Algebraic testing and weight distributions of codes
Theoretical Computer Science
Towards optimal lower bounds for clique and chromatic number
Theoretical Computer Science
Derandomizing homomorphism testing in general groups
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
SIAM Journal on Computing
Short locally testable codes and proofs: a survey in two parts
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Short locally testable codes and proofs
Studies in complexity and cryptography
Better inapproximability results for maxclique, chromatic number and min-3lin-deletion
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.01 |