What Have I Learned From Scott AaronsonDave Bacon PhysicistsComputer Scientists and What Else Would I Like to Learn from Them?
The Equivalence of Sampling and Searching Scott Aaronson MIT.
Multi-Query Computationally-Private Information Retrieval with Constant Communication Rate Jens Groth, University College London Aggelos Kiayias, University.
Uri Feige Microsoft Understanding Parallel Repetition Requires Understanding Foams Guy Kindler Weizmann Ryan ODonnell CMU.
Parallel Repetition of Two Prover Games Ran Raz Weizmann Institute and IAS.
A Parallel Repetition Theorem for Any Interactive Argument Or On the Benefits of Cutting Your Argument Short Iftach Haitner Microsoft Research New England.
Direct Product : Decoding & Testing, with Applications Russell Impagliazzo (IAS & UCSD) Ragesh Jaiswal (Columbia) Valentine Kabanets (SFU) Avi Wigderson.
P LAYING ( QUANTUM ) GAMES WITH OPERATOR SPACES David Pérez-García Universidad Complutense de Madrid Bilbao 8-Oct-2011.
On the Composition of Public- Coin Zero-Knowledge Protocols Rafael Pass (Cornell) Wei-Lung Dustin Tseng (Cornell) Douglas Wiktröm (KTH) 1.
Nir Bitansky and Omer Paneth. Interactive Proofs.
A Parallel Repetition Theorem for Entangled Projection Games Thomas Vidick Simons Institute, Berkeley Joint work with Irit Dinur (Weizmann) and David Steurer.
Parallel Repetition of Two Prover Games
