| 2019 | Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. | Amir Abboud |
| 2019 | Complexity-Theoretic Limitations on Blind Delegated Quantum Computation. | Scott Aaronson, Alexandru Cojocaru, Alexandru Gheorghiu, Elham Kashefi |
| 2019 | Scalable and Jointly Differentially Private Packing. | Zhiyi Huang, Xue Zhu |
| 2019 | Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. | Siddharth Gupta, Adrian Kosowski, Laurent Viennot |
| 2019 | The Satisfiability Threshold for Non-Uniform Random 2-SAT. | Tobias Friedrich, Ralf Rothenberger |
| 2019 | Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. | Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi |
| 2019 | Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. | Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone |
| 2019 | Non-Clairvoyant Precedence Constrained Scheduling. | Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla |
| 2019 | Amplification with One NP Oracle Query. | Thomas Watson |
| 2018 | Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. | Mingyu Xiao, Hiroshi Nagamochi |
| 2018 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2018 | Uniformization Problems for Synchronizations of Automatic Relations on Words. | Sarah Winter |
| 2018 | Lower Bounds by Algorithm Design: A Progress Report (Invited Paper). | Richard Ryan Williams |
| 2018 | Load Thresholds for Cuckoo Hashing with Overlapping Blocks. | Stefan Walzer |
| 2018 | Optimally Sorting Evolving Data. | Juan Jos Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson |
| 2018 | The Beta-Bernoulli process and algebraic effects. | Sam Staton, Dario Stein, Hongseok Yang, Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy |
| 2018 | Probability Theory from a Programming Perspective (Invited Paper). | Sam Staton |
| 2018 | A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity. | Tasuku Soma, Yuichi Yoshida |
| 2018 | Unambiguous Languages Exhaust the Index Hierarchy. | Michal Skrzypczak |
| 2018 | The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE. | Graud Snizergues, Armin Wei |
| 2018 | NC Algorithms for Weighted Planar Perfect Matching and Related Problems. | Piotr Sankowski |
| 2018 | Privacy Preserving Clustering with Constraints. | Clemens Rsner, Melanie Schmidt |
| 2018 | An Operational Characterization of Mutual Information in Algorithmic Information Theory. | Andrei Romashchenko, Marius Zimand |
| 2018 | Parameterized Algorithms for Zero Extension and Metric Labelling Problems. | Felix Reidl, Magnus Wahlstrm |
| 2018 | A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton. | Mikhail A. Raskin |