| 2019 | Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. | Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman |
| 2019 | Dichotomy for Symmetric Boolean PCSPs. | Miron Ficak, Marcin Kozik, Miroslav Olsk, Szymon Stankiewicz |
| 2019 | Auction Design under Interdependent Values (Invited Talk). | Michal Feldman |
| 2019 | Unique End of Potential Line. | John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani |
| 2019 | Reachability for Branching Concurrent Stochastic Games. | Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis |
| 2019 | Two Moves per Time Step Make a Difference. | Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner |
| 2019 | On the Complexity of String Matching for Graphs. | Massimo Equi, Roberto Grossi, Veli Mkinen, Alexandru I. Tomescu |
| 2019 | Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint. | Alina Ene, Huy L. Nguyen |
| 2019 | A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint. | Alina Ene, Huy L. Nguyen |
| 2019 | Deterministic Leader Election in Programmable Matter. | Yuval Emek, Shay Kutten, Ron Lavi, William K. Moses Jr. |
| 2019 | The Arboricity Captures the Complexity of Sampling Edges. | Talya Eden, Dana Ron, Will Rosenbaum |
| 2019 | Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs. | Guillaume Ducoffe |
| 2019 | Faster Algorithms for All Pairs Non-Decreasing Paths Problem. | Ran Duan, Ce Jin, Hongxun Wu |
| 2019 | A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. | Dani Dorfman, Haim Kaplan, Uri Zwick |
| 2019 | On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. | Julian Drfler, Christian Ikenmeyer, Greta Panova |
| 2019 | Exploration of High-Dimensional Grids by Finite Automata. | Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov |
| 2019 | Algorithmically Efficient Syntactic Characterization of Possibility Domains. | Josep Daz, Lefteris M. Kirousis, Sofia Kokonezi, John Livieratos |
| 2019 | Counting Answers to Existential Questions. | Holger Dell, Marc Roth, Philip Wellnitz |
| 2019 | Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. | Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis |
| 2019 | Approximations of Isomorphism and Logics with Linear-Algebraic Operators. | Anuj Dawar, Erich Grdel, Wied Pakusa |
| 2019 | Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. | Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein |
| 2019 | Approximation Algorithms for Min-Distance Problems. | Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu |
| 2019 | Energy Consumption of Group Search on a Line. | Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende |
| 2019 | Independent Sets in Vertex-Arrival Streams. | Graham Cormode, Jacques Dark, Christian Konrad |
| 2019 | On Reachability Problems for Low-Dimensional Matrix Semigroups. | Thomas Colcombet, Jol Ouaknine, Pavel Semukhin, James Worrell |