| 2017 | Kolmogorov complexity version of Slepian-Wolf coding. | Marius Zimand |
| 2017 | Katyusha: the first direct acceleration of stochastic gradient methods. | Zeyuan Allen Zhu |
| 2017 | Fully-dynamic minimum spanning forest with improved worst-case update time. | Christian Wulff-Nilsen |
| 2017 | Formula lower bounds via the quantum method. | Avishay Tal |
| 2017 | Explicit, almost optimal, epsilon-balanced codes. | Amnon Ta-Shma |
| 2017 | Fast convergence of learning in games (invited talk). | Vasilis Syrgkanis |
| 2017 | Real stable polynomials and matroids: optimization and counting. | Damian Straszak, Nisheeth K. Vishnoi |
| 2017 | Low rank approximation with entrywise l | Zhao Song, David P. Woodruff, Peilin Zhong |
| 2017 | Area-convexity, l | Jonah Sherman |
| 2017 | Answering FAQs in CSPs, probabilistic graphical models, databases, logic and matrix operations (invited talk). | Atri Rudra |
| 2017 | Why prices need algorithms (invited talk). | Tim Roughgarden, Inbal Talgam-Cohen |
| 2017 | Strongly refuting random CSPs below the spectral threshold. | Prasad Raghavendra, Satish Rao, Tselil Schramm |
| 2017 | Strongly exponential lower bounds for monotone computation. | Toniann Pitassi, Robert Robere |
| 2017 | Pseudorandomness of ring-LWE for any ring and modulus. | Chris Peikert, Oded Regev, Noah Stephens-Davidowitz |
| 2017 | A time- and message-optimal distributed algorithm for minimum spanning trees. | Gopal Pandurangan, Peter Robinson, Michele Scquizzato |
| 2017 | A simpler and faster strongly polynomial algorithm for generalized flow maximization. | Neil Olver, Lszl A. Vgh |
| 2017 | Pseudodeterministic constructions in subexponential time. | Igor C. Oliveira, Rahul Santhanam |
| 2017 | Efficient quantum tomography II. | Ryan O'Donnell, John Wright |
| 2017 | Practical post-quantum key agreement from generic lattices (invited talk). | Valeria Nikolaenko |
| 2017 | Complexity of short Presburger arithmetic. | Danny Nguyen, Igor Pak |
| 2017 | Trace reconstruction with exp(O(n | Fedor Nazarov, Yuval Peres |
| 2017 | A quantum linearity test for robustly verifying entanglement. | Anand Natarajan, Thomas Vidick |
| 2017 | The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n. | Assaf Naor, Robert Young |
| 2017 | Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n | Danupon Nanongkai, Thatchaphol Saranurak |
| 2017 | Approximate counting, the Lovasz local lemma, and inference in graphical models. | Ankur Moitra |