Endorsed by
ACM SIGACT

Articles by Johan Håstad

Volume 3, Article 11 (pages 211-219)
The Randomized Communication Complexity of Set Disjointness
by Johan Håstad and Avi Wigderson
Volume 1, Article 7 (pages 119-148)
Query Efficient PCPs with Perfect Completeness
by Johan Håstad and Subhash Khot