Lower bounds for algebraic computation trees
Another advantage of free choice (Extended Abstract)
Multi-prover interactive proofs: how to remove intractability
Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC ’83
Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC ’83
Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC ’88
Joe Kilian
Shafi Goldwasser
Avi Widgerson
Quiescent consensus in mobile ad-hoc networks using eventually storage-free broadcasts
Faster Algorithms for Computing Plurality Points
Two prover protocols