Volume 16 (2020)
Vol 16, Article 1 (pp 1-23)
Distributed Corruption Detection in Networks
by Noga Alon, Elchanan Mossel, and Robin Pemantle
Vol 16, Article 2 (pp 1-18)
Threshold Secret Sharing Requires a Linear-Size Alphabet
by Andrej Bogdanov, Siyao Guo, and Ilan Komargodski
Vol 16, Article 3 (pp 1-36)
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps
by Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and C. Seshadhri
Vol 16, Article 4 (pp 1-50) [CCC18 Spec Issue]
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product
by Lijie Chen
Vol 16, Article 5 (pp 1-34)
On Axis-Parallel Tests for Tensor Product Codes
by Alessandro Chiesa, Peter Manohar, and Igor Shinkar
Vol 16, Article 6 (pp 1-20)
Sharp Bounds for Population Recovery
by Anindya De, Ryan O'Donnell, and Rocco A. Servedio
Vol 16, Article 7 (pp 1-50)
More on Bounded Independence Plus Noise: Pseudorandom Generators for Read-Once Polynomials
by Chin Ho Lee and Emanuele Viola
Vol 16, Article 8 (pp 1-55)
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing
by Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee
Vol 16, Article 9 (pp 1-12)
On the Complexity of Computing a Random Boolean Function Over the Reals
by Pavel Hrubeš
Vol 16, Article 10 (pp 1-71)
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials
by Mark Bun, Robin Kothari, and Justin Thaler
Vol 16, Article 11 (pp 1-8) [NOTE]
On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking
by Scott Aaronson and Sam Gunn
Vol 16, Article 12 (pp 1-18)
Optimality of Correlated Sampling Strategies
by Mohammad Bavarian, Badih Ghazi, Elad Haramaty, Pritish Kamath, Ronald L. Rivest, and Madhu Sudan
Vol 16, Article 13 (pp 1-30)
Monotone Circuit Lower Bounds from Resolution
by Ankit Garg, Mika Göös, Pritish Kamath, and Dmitry Sokolov
Vol 16, Article 14 (pp 1-8) [NOTE]
On the Hardness of Approximating the $k$-Way Hypergraph Cut problem
by Chandra Chekuri and Shi Li
Vol 16, Article 15 (pp 1-25) [APRX-RND16 Spec Issue]
Online Row Sampling
by Michael B. Cohen, Cameron Musco, and Jakub Pachocki
Vol 16, Article 16 (pp 1-30)
A Characterization of Hard-to-Cover CSPs
by Amey Bhangale, Prahladh Harsha, and Girish Varma
Vol 16, Article 17 (pp 1-29)
Concentration for Limited Independence via Inequalities for the Elementary Symmetric Polynomials
by Parikshit Gopalan and Amir Yehudayoff
Vol 16, Article 18 (pp 1-68)
Relaxed Locally Correctable Codes
by Tom Gur, Govind Ramnarayan, and Ron Rothblum
Vol 16, Article 19 (pp 1-5) [CCC19 Spec Issue]
Special Issue: CCC 2019: Guest Editor's Foreword
by Yuval Filmus
Vol 16, Article 20 (pp 1-48) [CCC19 Spec Issue]
Fourier and Circulant Matrices are Not Rigid
by Zeev Dvir and Allen Liu
List of Editors