default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing, Volume 16
Volume 16, 2020
- Noga Alon, Elchanan Mossel, Robin Pemantle:
Distributed Corruption Detection in Networks. 1-23 - Andrej Bogdanov, Siyao Guo, Ilan Komargodski:
Threshold Secret Sharing Requires a Linear-Size Alphabet. 1-18 - Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor
, Sofya Raskhodnikova, C. Seshadhri:
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. 1-36 - Lijie Chen:
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. 1-50 - Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Axis-Parallel Tests for Tensor Product Codes. 1-34 - Anindya De, Ryan O'Donnell, Rocco A. Servedio:
Sharp Bounds for Population Recovery. 1-20 - Chin Ho Lee, Emanuele Viola:
More on Bounded Independence Plus Noise: Pseudorandom Generators for Read-Once Polynomials. 1-50 - Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. 1-55 - Pavel Hrubes:
On the Complexity of Computing a Random Boolean Function Over the Reals. 1-12 - Mark Bun, Robin Kothari, Justin Thaler:
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials. 1-71 - Scott Aaronson, Sam Gunn:
On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking. 1-8 - Mohammad Bavarian, Badih Ghazi, Elad Haramaty, Pritish Kamath, Ronald L. Rivest, Madhu Sudan:
Optimality of Correlated Sampling Strategies. 1-18 - Ankit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov:
Monotone Circuit Lower Bounds from Resolution. 1-30 - Chandra Chekuri, Shi Li:
On the Hardness of Approximating the k-Way Hypergraph Cut problem. 1-8 - Michael B. Cohen, Cameron Musco, Jakub Pachocki:
Online Row Sampling. 1-25 - Amey Bhangale, Prahladh Harsha, Girish Varma:
A Characterization of Hard-to-Cover CSPs. 1-30 - Parikshit Gopalan, Amir Yehudayoff:
Concentration for Limited Independence via Inequalities for the Elementary Symmetric Polynomials. 1-29 - Tom Gur, Govind Ramnarayan, Ron Rothblum:
Relaxed Locally Correctable Codes. 1-68 - Yuval Filmus:
Special Issue: CCC 2019: Guest Editor's Foreword. 1-5 - Zeev Dvir, Allen Liu:
Fourier and Circulant Matrices are Not Rigid. 1-48
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-12 01:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
