| 2017 | Fair Scheduling via Iterative Quasi-Uniform Sampling. | Sungjin Im, Benjamin Moseley |
| 2017 | Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. | Pavel Hubcek, Eylon Yogev |
| 2017 | Stochastic | Lingxiao Huang, Jian Li |
| 2017 | Popularity, Mixed Matchings, and Self-duality. | Chien-Chung Huang, Telikepalli Kavitha |
| 2017 | Fully Dynamic Connectivity in | Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie |
| 2017 | A Logarithmic Additive Integrality Gap for Bin Packing. | Rebecca Hoberg, Thomas Rothvoss |
| 2017 | Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. | Robert Hildebrand, Robert Weismantel, Rico Zenklusen |
| 2017 | Faster approximation schemes for the two-dimensional knapsack problem. | Sandy Heydrich, Andreas Wiese |
| 2017 | Local Flow Partitioning for Faster Edge Connectivity. | Monika Henzinger, Satish Rao, Di Wang |
| 2017 | Sequential measurements, disturbance and property testing. | Aram W. Harrow, Cedric Yen-Yu Lin, Ashley Montanaro |
| 2017 | Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovsz Local Lemma. | David G. Harris |
| 2017 | Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. | Sariel Har-Peled, Sepideh Mahabadi |
| 2017 | Bridging the Capacity Gap Between Interactive and One-Way Communication. | Bernhard Haeupler, Ameya Velingker |
| 2017 | Parallel algorithms and concentration bounds for the Lovsz Local Lemma via witness-DAGs. | Bernhard Haeupler, David G. Harris |
| 2017 | MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth. | Venkatesan Guruswami, Ankit Singh Rawat |
| 2017 | Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions. | Anupam Gupta, Viswanath Nagarajan, Sahil Singla |
| 2017 | LAST but not Least: Online Spanners for Buy-at-Bulk. | Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh |
| 2017 | Random cluster dynamics for the Ising model is rapidly mixing. | Heng Guo, Mark Jerrum |
| 2017 | Sampling on the Sphere by Mutually Orthogonal Subspaces. | Uri Grupel |
| 2017 | To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese, Hang Zhou |
| 2017 | Faster Sublinear Algorithms using Conditional Sampling. | Themistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis |
| 2017 | Distance Sensitive Bloom Filters Without False Negatives. | Mayank Goswami, Rasmus Pagh, Francesco Silvestri, Johan Sivertsen |
| 2017 | Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound. | Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf |
| 2017 | Maximally Recoverable Codes for Grid-like Topologies. | Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin |
| 2017 | Approximation Algorithms for Finding Maximum Induced Expanders. | Shayan Oveis Gharan, Alireza Rezaei |