| 2018 | A Faster Distributed Single-Source Shortest Paths Algorithm. | Sebastian Forster, Danupon Nanongkai |
| 2018 | Pseudorandom Generators for Read-Once Branching Programs, in Any Order. | Michael A. Forbes, Zander Kelley |
| 2018 | 1-Factorizations of Pseudorandom Graphs. | Asaf Ferber, Vishesh Jain |
| 2018 | An End-to-End Argument in Mechanism Design (Prior-Independent Auctions for Budgeted Agents). | Yiding Feng, Jason D. Hartline |
| 2018 | Privacy Amplification by Iteration. | Vitaly Feldman, Ilya Mironov, Kunal Talwar, Abhradeep Thakurta |
| 2018 | Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes. | Omar Fawzi, Antoine Grospellier, Anthony Leverrier |
| 2018 | Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm. | Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu |
| 2018 | Metric Sublinear Algorithms via Linear Sampling. | Hossein Esfandiari, Michael Mitzenmacher |
| 2018 | Approximating the Permanent of a Random Matrix with Vanishing Mean. | Lior Eldar, Saeed Mehraban |
| 2018 | Learning Sums of Independent Random Variables with Sparse Collective Support. | Anindya De, Philip M. Long, Rocco A. Servedio |
| 2018 | Efficient Statistics, in High Dimensions, from Truncated Samples. | Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis |
| 2018 | Balancing Vectors in Any Norm. | Daniel Dadush, Aleksandar Nikolov, Kunal Talwar, Nicole Tomczak-Jaegermann |
| 2018 | Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. | Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford |
| 2018 | Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. | Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang |
| 2018 | Testing Graph Clusterability: Algorithms and Lower Bounds. | Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres |
| 2018 | A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. | Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan |
| 2018 | Spatial Isolation Implies Zero Knowledge Even in a Quantum World. | Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner |
| 2018 | Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors. | Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu |
| 2018 | Near-Optimal Approximate Decremental All Pairs Shortest Paths. | Shiri Chechik |
| 2018 | A Short List of Equalities Induces Large Sign Rank. | Arkadev Chattopadhyay, Nikhil S. Mande |
| 2018 | Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time. | Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Kouck, Michael E. Saks |
| 2018 | The Complexity of General-Valued CSPs Seen from the Other Side. | Clment Carbonnel, Miguel Romero, Stanislav Zivn |
| 2018 | Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes. | Peter Brgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson |
| 2018 | A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. | Zvika Brakerski, Paul F. Christiano, Urmila Mahadev, Umesh V. Vazirani, Thomas Vidick |
| 2018 | Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation. | Christian Borgs, Jennifer T. Chayes, Adam D. Smith, Ilias Zadik |