- Ankit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov 0001. Monotone Circuit Lower Bounds from Resolution. Theory of Computing, 16:1-30, 2020.
- Pavel Hrubes. On the Complexity of Computing a Random Boolean Function Over the Reals. Theory of Computing, 16:1-12, 2020.
- Parikshit Gopalan, Amir Yehudayoff. Concentration for Limited Independence via Inequalities for the Elementary Symmetric Polynomials. Theory of Computing, 16:1-29, 2020.
- Amey Bhangale, Prahladh Harsha, Girish Varma. A Characterization of Hard-to-Cover CSPs. Theory of Computing, 16:1-30, 2020.
- Chin Ho Lee, Emanuele Viola. More on Bounded Independence Plus Noise: Pseudorandom Generators for Read-Once Polynomials. Theory of Computing, 16:1-50, 2020.
- Lijie Chen. On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. Theory of Computing, 16:1-50, 2020.
- Mark Bun, Robin Kothari, Justin Thaler. The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials. Theory of Computing, 16:1-71, 2020.
- Mohammad Bavarian, Badih Ghazi, Elad Haramaty, Pritish Kamath, Ronald L. Rivest, Madhu Sudan. Optimality of Correlated Sampling Strategies. Theory of Computing, 16:1-18, 2020.
- Yuval Filmus. Special Issue: CCC 2019: Guest Editor's Foreword. Theory of Computing, 16:1-5, 2020.
- Andrej Bogdanov, Siyao Guo, Ilan Komargodski. Threshold Secret Sharing Requires a Linear-Size Alphabet. Theory of Computing, 16:1-18, 2020.