Articles by Shachar Lovett
 ToC Library Graduate Surveys 8 (2017) 55 pages Additive Combinatorics and its Applications in Theoretical Computer Science
 ToC Library Graduate Surveys 6 (2015) 14 pages An Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem
 Vol 15, Article 21 (pp 1-27) The Gram--Schmidt Walk: A Cure for the Banaszczyk Blues
 Vol 15, Article 15 (pp 1-58) [APRX-RND16 Spec Issue] Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem
 Vol 15, Article 10 (pp 1-26) [CCC18 Spec Issue] Pseudorandom Generators from Polarizing Random Walks
 Vol 14, Article 2 (pp 1-2) [CCC17 Spec Issue] Special Issue: CCC 2017: Guest Editor's Foreword by Shachar Lovett and Ryan O'Donnell
 Vol 9, Article 15 (pp 559-577) [APRX-RND12 Spec Issue] Almost $k$-Wise vs. $k$-Wise Independent Permutations, and Uniformity for General Group Actions by Noga Alon and Shachar Lovett
 Vol 7, Article 13 (pp 185-188) [NOTE] Computing Polynomials with Few Multiplications
 Vol 7, Article 9 (pp 131-145) Inverse Conjecture for the Gowers Norm is False
 Vol 5, Article 3 (pp 69-82) Unconditional Pseudorandom Generators for Low-Degree Polynomials