| 2017 | Proof Complexity Meets Algebra. | Albert Atserias, Joanna Ochremiak |
| 2017 | Universal Framework for Wireless Scheduling Problems. | Eyjlfur Ingi sgeirsson, Magns M. Halldrsson, Tigran Tonoyan |
| 2017 | Pumping Lemma for Higher-order Languages. | Kazuyuki Asada, Naoki Kobayashi |
| 2017 | Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. | Daniel Apon, Nico Dttling, Sanjam Garg, Pratyay Mukherjee |
| 2017 | A QPTAS for the General Scheduling Problem with Identical Release Dates. | Antonios Antoniadis, Ruben Hoeksma, Julie Meiner, Jos Verschae, Andreas Wiese |
| 2017 | A Circuit-Based Approach to Efficient Enumeration. | Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel |
| 2017 | Automata-Based Stream Processing. | Rajeev Alur, Konstantinos Mamouras, Caleb Stanford |
| 2017 | Dynamic Parameterized Problems and Algorithms. | Josh Alman, Matthias Mnich, Virginia Vassilevska Williams |
| 2017 | The Polytope-Collision Problem. | Shaull Almagor, Jol Ouaknine, James Worrell |
| 2017 | On the Value of Penalties in Time-Inconsistent Planning. | Susanne Albers, Dennis Kraft |
| 2017 | Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs. | Sara Ahmadian, Zachary Friggstad |
| 2017 | Reusable Garbled Deterministic Finite Automata from Learning With Errors. | Shweta Agrawal, Ishaan Preet Singh |
| 2017 | When the Optimum is also Blind: a New Perspective on Universal Optimization. | Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk |
| 2017 | Stochastic Control via Entropy Compression. | Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis |
| 2017 | Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. | Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bk Tejs Knudsen, Morten Stckel |
| 2017 | Embeddings of Schatten Norms with Applications to Data Streams. | Yi Li, David P. Woodruff |
| 2017 | Efficient Approximations for the Online Dispersion Problem. | Jing Chen, Bo Li, Yingkai Li |
| 2016 | Optimization Algorithms for Faster Computational Geometry. | Zeyuan Allen Zhu, Zhenyu Liao, Yang Yuan |
| 2016 | The Complexity of Downward Closure Comparisons. | Georg Zetzsche |
| 2016 | A Parallel Repetition Theorem for All Entangled Games. | Henry Yuen |
| 2016 | Simple Average-Case Lower Bounds for Approximate Near-Neighbor from Isoperimetric Inequalities. | Yitong Yin |
| 2016 | Front Matter, Table of Contents, Preface, Organization, List of Authors. | |
| 2016 | Past, Present, and Infinite Future. | Thomas Wilke |
| 2016 | Information Cascades on Arbitrary Topologies. | Jun Wan, Yu Xia, Liang Li, Thomas Moscibroda |
| 2016 | Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction. | Di Wang, Satish Rao, Michael W. Mahoney |