ACM - affordances
Uri Feige
Joe Kilian
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC ’94
Approximating clique is almost NP-complete
Two-prover one-round proof systems
On the Power of Multi-Prover Interactive Protocols
Errata for On the Power of Multi-Prover Interactive Protocols
The Knowledge Complexity of Interactive Proof Systems
Strong Separation Models of Multi Prover Interactive Proofs