| 2018 | EPTAS for Max Clique on Disks and Unit Balls. | Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stphan Thomass |
| 2018 | Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. | Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich |
| 2018 | An ETH-Tight Exact Algorithm for Euclidean TSP. | Mark de Berg, Hans L. Bodlaender, Sndor Kisfaludi-Bak, Sudeshna Kolay |
| 2018 | Bloom Filters, Adaptivity, and the Dictionary Problem. | Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh |
| 2018 | Classical Lower Bounds from Quantum Upper Bounds. | Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari |
| 2018 | Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. | Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri |
| 2018 | Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time. | Jatin Batra, Naveen Garg, Amit Kumar |
| 2018 | Non-Malleable Codes for Small-Depth Circuits. | Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan |
| 2018 | Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization. | Maria-Florina Balcan, Travis Dick, Ellen Vitercik |
| 2018 | Efficient Density Evaluation for Smooth Kernels. | Arturs Backurs, Moses Charikar, Piotr Indyk, Paris Siminelakis |
| 2018 | Improved Online Algorithm for Weighted Flow Time. | Yossi Azar, Noam Touitou |
| 2018 | Towards Learning Sparsely Used Dictionaries with Arbitrary Supports. | Pranjal Awasthi, Aravindan Vijayaraghavan |
| 2018 | Parallel Graph Connectivity in Log Diameter Rounds. | Alexandr Andoni, Zhao Song, Clifford Stein, Zhengyu Wang, Peilin Zhong |
| 2018 | Hlder Homeomorphisms and Approximate Nearest Neighbors. | Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2018 | Planar Graph Perfect Matching Is in NC. | Nima Anari, Vijay V. Vazirani |
| 2018 | Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids. | Nima Anari, Shayan Oveis Gharan, Cynthia Vinzant |
| 2018 | Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. | Josh Alman, Virginia Vassilevska Williams |
| 2018 | Random Order Contention Resolution Schemes. | Marek Adamczyk, Michal Wlodarczyk |
| 2018 | Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. | Akash Kumar, C. Seshadhri, Andrew Stolman |
| 2018 | Sublinear Algorithms for Local Graph Centrality Estimation. | Marco Bressan, Enoch Peserico, Luca Pretto |
| 2017 | A Proof of CSP Dichotomy Conjecture. | Dmitriy Zhuk |
| 2017 | Obfuscating Compute-and-Compare Programs under LWE. | Daniel Wichs, Giorgos Zirdelis |
| 2017 | Capacity of Neural Networks for Lifelong Learning of Composable Tasks. | Leslie G. Valiant |
| 2017 | Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound. | Itzhak Tamo, Min Ye, Alexander Barg |
| 2017 | The Matching Problem in General Graphs Is in Quasi-NC. | Ola Svensson, Jakub Tarnawski |