- Anup Rao, Makrand Sinha. Simplified Separation of Information and Communication. Theory of Computing, 14(1):1-29, 2018.
- Ashley Montanaro. Quantum-Walk Speedup of Backtracking Algorithms. Theory of Computing, 14(1):1-24, 2018.
- Michael A. Forbes, Amir Shpilka, Ben lee Volk. Succinct Hitting Sets and Barriers to Proving Lower Bounds for Algebraic Circuits. Theory of Computing, 14(1):1-45, 2018.
- Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li. Trading Information Complexity for Error. Theory of Computing, 14(1):1-73, 2018.
- Shachar Lovett, Ryan O'Donnell. Special Issue: CCC 2017: Guest Editor's Foreword. Theory of Computing, 14(1):1-2, 2018.
- Benny Applebaum, Liron David, Guy Even. Explicit Rateless Codes for Memoryless Binary-Input Output-Symmetric Channels. Theory of Computing, 14(1):1-29, 2018.
- Yfke Dulek, Christian Schaffner, Florian Speelman. Quantum Homomorphic Encryption for Polynomial-Size Circuits. Theory of Computing, 14(1):1-45, 2018.
- Shalev Ben-David, Robin Kothari. Randomized Query Complexity of Sabotaged and Composed Functions. Theory of Computing, 14(1):1-27, 2018.
- Neeraj Kayal, Chandan Saha 0001, Sébastien Tavenas. On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree. Theory of Computing, 14(1):1-46, 2018.
- R. Ryan Williams. New Algorithms and Lower Bounds for Circuits With Linear Threshold Gates. Theory of Computing, 14(1):1-25, 2018.