Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
CRYPTO '88 Proceedings on Advances in cryptology
Approximating linear programming is log-space complete for P
Information Processing Letters
A note on approximate linear programming
Information Processing Letters
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Multi-oracle interactive protocols with constant space verifiers
Journal of Computer and System Sciences
A parallel approximation algorithm for positive linear programming
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Simple strategies for large zero-sum games with applications to complexity theory
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Symmetric alternation captures BPP
Computational Complexity
Journal of the ACM (JACM)
Universal games of incomplete information
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A game-theoretic classification of interactive complexity classes
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Probabilistically Checkable Debate Systems and Nonapproximabilityof PSPACE-Hard Functions
Probabilistically Checkable Debate Systems and Nonapproximabilityof PSPACE-Hard Functions
Toward a general theory of quantum games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
Proceedings of the forty-second ACM symposium on Theory of computing
Practical delegation of computation using multiple servers
Proceedings of the 18th ACM conference on Computer and communications security
Journal of the ACM (JACM)
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Two protocols for delegation of computation
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Competing provers protocols for circuit evaluation
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Efficient location-based decision-supporting content distribution to mobile groups
IEEE/ACM Transactions on Networking (TON)
Delegation of computation with verification outsourcing: curious verifiers
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |