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)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Some optimal inapproximability results
Journal of the ACM (JACM)
Many-Valued Logics and Holographic Proofs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
Fast approximate probabilistically checkable proofs
Information and Computation
Robust pcps of proximity, shorter pcps and applications to coding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Parallel repetition: simplifications and the no-signaling case
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An efficient parallel repetition theorem for Arthur-Merlin games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
Computational Complexity
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Polynomial-space approximation of no-signaling provers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Interactive locking, zero-knowledge PCPs, and unconditional cryptography
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
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
Parallel repetition of entangled games
Proceedings of the forty-third annual ACM symposium on Theory of computing
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's
Quantum Information & Computation
Short locally testable codes and proofs
Studies in complexity and cryptography
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On efficient zero-knowledge PCPs
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
ACM Transactions on Computation Theory (TOCT)
Languages with efficient zero-knowledge PCPs are in SZK
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 5.23 |