Matrix analysis
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
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
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
SIAM Review
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Complexity theory retrospective II
Complexity theory retrospective II
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fault-tolerant quantum computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Cryptographic distinguishability measures for quantum-mechanical states
IEEE Transactions on Information Theory
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Zero-knowledge against quantum attacks
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Uniformity of quantum circuit families for error-free algorithms
Theoretical Computer Science
Toward a general theory of quantum games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
Computational Complexity
Quantum Information Processing
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
General properties of quantum zero-knowledge proofs
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Interactive and noninteractive zero knowledge are equivalent in the help model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Proceedings of the forty-second ACM symposium on Theory of computing
Communications of the ACM
On the complexity of approximating the diamond norm
Quantum Information & Computation
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's
Quantum Information & Computation
Distinguishing quantum operations having few Kraus operators
Quantum Information & Computation
On perfect completeness for QMA
Quantum Information & Computation
Quantum commitments from complexity assumptions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Journal of the ACM (JACM)
Entangled Games Are Hard to Approximate
SIAM Journal on Computing
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Entanglement in interactive proof systems with binary answers
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
An application of quantum finite automata to interactive proof systems (extended abstract)
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Complete problem for perfect zero-knowledge quantum proof
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems
Quantum Information & Computation
Stronger methods of making quantum interactive proofs perfectly complete
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
QMA variants with polynomially many provers
Quantum Information & Computation
Guest column: the quantum PCP conjecture
ACM SIGACT News
| Hi-index | 0.02 |