| 2018 | Collusion resistant traitor tracing from learning with errors. | Rishab Goyal, Venkata Koppula, Brent Waters |
| 2018 | Non-malleable secret sharing. | Vipul Goyal, Ashutosh Kumar |
| 2018 | Bounding the menu-size of approximately optimal auctions via optimal-transport duality. | Yannai A. Gonczarowski |
| 2018 | A generalized Turn problem and its applications. | Lior Gishboliner, Asaf Shapira |
| 2018 | Improved distributed algorithms for exact shortest paths. | Mohsen Ghaffari, Jason Li |
| 2018 | Deterministic distributed edge-coloring with fewer colors. | Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto |
| 2018 | Extractor-based time-space lower bounds for learning. | Sumegha Garg, Ran Raz, Avishay Tal |
| 2018 | A matrix expander Chernoff bound. | Ankit Garg, Yin Tat Lee, Zhao Song, Nikhil Srivastava |
| 2018 | Monotone circuit lower bounds from resolution. | Ankit Garg, Mika Gs, Pritish Kamath, Dmitry Sokolov |
| 2018 | Operator scaling with specified marginals. | Cole Franks |
| 2018 | A PSPACE construction of a hitting set for the closure of small algebraic circuits. | Michael A. Forbes, Amir Shpilka |
| 2018 | Nearly work-efficient parallel algorithm for digraph reachability. | Jeremy T. Fineman |
| 2018 | Consensus halving is PPA-complete. | Aris Filos-Ratsikas, Paul W. Goldberg |
| 2018 | Efficient decoding of random errors for quantum expander codes. | Omar Fawzi, Antoine Grospellier, Anthony Leverrier |
| 2018 | Approximating generalized network design under (dis)economies of scale with applications to energy efficiency. | Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi |
| 2018 | Interactive coding over the noisy broadcast channel. | Klim Efremenko, Gillat Kol, Raghuvansh Saxena |
| 2018 | On approximating the number of k-cliques in sublinear time. | Talya Eden, Dana Ron, C. Seshadhri |
| 2018 | Discovering the roots: uniform closure results for algebraic classes under factoring. | Pranjal Dutta, Nitin Saxena, Amit Sinhababu |
| 2018 | Universal protocols for information dissemination using emergent signals. | Bartlomiej Dudek, Adrian Kosowski |
| 2018 | On non-optimally expanding sets in Grassmann graphs. | Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra |
| 2018 | Towards a proof of the 2-to-1 games conjecture? | Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra |
| 2018 | Learning geometric concepts with nasty noise. | Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart |
| 2018 | List-decodable robust mean estimation and learning mixtures of spherical gaussians. | Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart |
| 2018 | Fine-grained reductions from approximate counting to decision. | Holger Dell, John Lapinskas |
| 2018 | A converse to Banach's fixed point theorem and its CLS-completeness. | Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis |