Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Playing games of incomplete information: 58
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Entropy and information theory
Entropy and information theory
Efficient identification schemes using two prover interactive proofs
CRYPTO '89 Proceedings on Advances in cryptology
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
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
On the distributional complexity of disjointness
Theoretical Computer Science
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
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
A One-Round, Two-Prover, Zero-Knowledge Protocol for NP
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Low Communication 2-Prover Zero-Knowledge Proofs for NP
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
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
Impossibility results for recycling random bits in two-prover proof systems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Testing of the long code and hardness for clique
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover (preliminary version)
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
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Direct product results and the GCD problem, in old and new communication models
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
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)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Many-Valued Logics and Holographic Proofs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Hardness of Set Cover with Intersection 1
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Strong Inapproximability of the Basic k-Spanner Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Bounds for the Minimum Disagreement Problem with Applications to Learning Theory
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Sharing one secret vs. sharing many secrets
Theoretical Computer Science - Mathematical foundations of computer science
Randomized approximations of the constraint satisfaction problem
Nordic Journal of Computing
Maximizing agreements and coagnostic learning
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
An efficient parallel repetition theorem for Arthur-Merlin games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the role of shared entanglement
Quantum Information & Computation
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A note on the subadditive network design problem
Operations Research Letters
| Hi-index | 0.00 |