A Parallel Repetition Theorem
Extracting all the randomness and reducing the error in Trevisan’s extractors
Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC ’99
SIAM Journal on Computing
Salil Vadhan
Omer Reingold
Uncertainty principles, extractors, and explicit embeddings of l2 into l1
Bypassing UGC from Some Optimal Geometric Inapproximability Results