| 2017 | On the complexity of local distributed graph problems. | Mohsen Ghaffari, Fabian Kuhn, Yannic Maus |
| 2017 | Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria. | Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod |
| 2017 | Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling. | Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson |
| 2017 | The next 700 network programming languages (invited talk). | Nate Foster |
| 2017 | Succinct hitting sets and barriers to proving algebraic circuits lower bounds. | Michael A. Forbes, Amir Shpilka, Ben Lee Volk |
| 2017 | Approximate modularity revisited. | Uriel Feige, Michal Feldman, Inbal Talgam-Cohen |
| 2017 | How well do local algorithms solve semidefinite programs? | Zhou Fan, Andrea Montanari |
| 2017 | Distributed exact shortest paths in sublinear time. | Michael Elkin |
| 2017 | DecreaseKeys are expensive for external memory priority queues. | Kasper Eenberg, Kasper Green Larsen, Huacheng Yu |
| 2017 | Sampling random spanning trees faster than matrix multiplication. | David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva |
| 2017 | Bernoulli factories and black-box reductions in mechanism design. | Shaddin Dughmi, Jason D. Hartline, Robert Kleinberg, Rad Niazadeh |
| 2017 | Optimal mean-based algorithms for trace reconstruction. | Anindya De, Ryan O'Donnell, Rocco A. Servedio |
| 2017 | Finding even cycles faster via capped k-walks. | Sren Dahlgaard, Mathias Bk Tejs Knudsen, Morten Stckel |
| 2017 | Twenty (simple) questions. | Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran |
| 2017 | Homomorphisms are a good basis for counting small subgraphs. | Radu Curticapean, Holger Dell, Dniel Marx |
| 2017 | Information-theoretic thresholds from the cavity method. | Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborov |
| 2017 | Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. | Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu |
| 2017 | Towards optimal two-source extractors and Ramsey graphs. | Gil Cohen |
| 2017 | New hardness results for routing on disjoint paths. | Julia Chuzhoy, David H. K. Kim, Rachit Nimavat |
| 2017 | Set similarity search beyond MinHash. | Tobias Christiani, Rasmus Pagh |
| 2017 | Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness. | Xi Chen, Erik Waingarten, Jinyu Xie |
| 2017 | Addition is exponentially harder than counting for shallow monotone circuits. | Xi Chen, Igor C. Oliveira, Rocco A. Servedio |
| 2017 | Stability of service under time-of-use pricing. | Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan |
| 2017 | Non-malleable codes and extractors for small-depth circuits, and affine functions. | Eshan Chattopadhyay, Xin Li |
| 2017 | Learning from untrusted data. | Moses Charikar, Jacob Steinhardt, Gregory Valiant |