| 2017 | The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation. | Pierre-tienne Meunier, Damien Woods |
| 2017 | Optimizing tree pattern queries: why cutting is not enough (invited talk). | Wim Martens |
| 2017 | Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph. | Pasin Manurangsi |
| 2017 | Lossy kernelization. | Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2017 | Improved non-malleable extractors, non-malleable codes and independent source extractors. | Xin Li |
| 2017 | Geodesic walks in polytopes. | Yin Tat Lee, Santosh S. Vempala |
| 2017 | An SDP-based algorithm for linear-sized spectral sparsification. | Yin Tat Lee, He Sun |
| 2017 | Examining classical graph-theory problems from the viewpoint of formal-verification methods (invited talk). | Orna Kupferman |
| 2017 | Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs. | Pravesh K. Kothari, Raghu Meka, Prasad Raghavendra |
| 2017 | Sum of squares lower bounds for refuting any CSP. | Pravesh K. Kothari, Ryuhei Mori, Ryan O'Donnell, David Witmer |
| 2017 | Time-space hardness of learning sparse parities. | Gillat Kol, Ran Raz, Avishay Tal |
| 2017 | On independent sets, 2-to-2 games, and Grassmann graphs. | Subhash Khot, Dor Minzer, Muli Safra |
| 2017 | A polynomial restriction lemma with applications. | Valentine Kabanets, Daniel M. Kane, Zhenjian Lu |
| 2017 | Compression of quantum multi-prover interactive proofs. | Zhengfeng Ji |
| 2017 | A weighted linear matroid parity algorithm. | Satoru Iwata, Yusuke Kobayashi |
| 2017 | Decremental single-source reachability in planar digraphs. | Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski |
| 2017 | Efficient massively parallel methods for dynamic programming. | Sungjin Im, Benjamin Moseley, Xiaorui Sun |
| 2017 | Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace. | William M. Hoza, Chris Umans |
| 2017 | Synchronization strings: codes for insertions and deletions approaching the Singleton bound. | Bernhard Haeupler, Amirbehshad Shahrasbi |
| 2017 | Linear matroid intersection is in quasi-NC. | Rohit Gurjar, Thomas Thierauf |
| 2017 | Online and dynamic algorithms for set cover. | Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi |
| 2017 | Uniform sampling through the Lovasz local lemma. | Heng Guo, Mark Jerrum, Jingcheng Liu |
| 2017 | Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. | Fabrizio Grandoni, Bundit Laekhanukit |
| 2017 | Efficient empirical revenue maximization in single-parameter auction environments. | Yannai A. Gonczarowski, Noam Nisan |
| 2017 | Removal lemmas with polynomial bounds. | Lior Gishboliner, Asaf Shapira |