| 1 | -- | 29 | Anup Rao, Makrand Sinha. Simplified Separation of Information and Communication |
| 1 | -- | 24 | Ashley Montanaro. Quantum-Walk Speedup of Backtracking Algorithms |
| 1 | -- | 45 | Michael A. Forbes, Amir Shpilka, Ben lee Volk. Succinct Hitting Sets and Barriers to Proving Lower Bounds for Algebraic Circuits |
| 1 | -- | 73 | Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li. Trading Information Complexity for Error |
| 1 | -- | 2 | Shachar Lovett, Ryan O'Donnell. Special Issue: CCC 2017: Guest Editor's Foreword |
| 1 | -- | 29 | Benny Applebaum, Liron David, Guy Even. Explicit Rateless Codes for Memoryless Binary-Input Output-Symmetric Channels |
| 1 | -- | 45 | Yfke Dulek, Christian Schaffner, Florian Speelman. Quantum Homomorphic Encryption for Polynomial-Size Circuits |
| 1 | -- | 27 | Shalev Ben-David, Robin Kothari. Randomized Query Complexity of Sabotaged and Composed Functions |
| 1 | -- | 46 | Neeraj Kayal, Chandan Saha 0001, Sébastien Tavenas. On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree |
| 1 | -- | 25 | R. Ryan Williams. New Algorithms and Lower Bounds for Circuits With Linear Threshold Gates |
| 1 | -- | 24 | Swastik Kopparty, Srikanth Srinivasan 0001. Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression |
| 1 | -- | 33 | Mrinalkanti Ghosh, Madhur Tulsiani. From Weak to Strong Linear Programming Gaps for All Constraint Satisfaction Problems |
| 1 | -- | 37 | Anne Broadbent. How to Verify a Quantum Computation |
| 1 | -- | 21 | Markus Bläser, Gorav Jindal, Anurag Pandey. A Deterministic PTAS for the Commutative Rank of Matrix Spaces |
| 1 | -- | 29 | Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson. Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits |
| 1 | -- | 17 | Alexander A. Sherstov. On Multiparty Communication with Large versus Unbounded Error |
| 1 | -- | 27 | Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang. Linear-Time Algorithm for Quantum 2SAT |
| 1 | -- | 17 | Daniele Micciancio. On the Hardness of Learning With Errors with Binary Secrets |
| 1 | -- | 35 | Jack Murtagh, Salil P. Vadhan. The Complexity of Computing the Optimal Composition of Differential Privacy |
| 1 | -- | 46 | Jayadev Acharya, Clément L. Canonne, Gautam Kamath. A Chasm Between Identity and Equivalence Testing with Conditional Queries |
| 1 | -- | 23 | Arkadev Chattopadhyay, Nikhil S. Mande. Separation of Unbounded-Error Models in Multi-Party Communication Complexity |
| 1 | -- | 55 | Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan 0001. Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits |