| 2019 | Dimension-independent Sparse Fourier Transform. | Michael Kapralov, Ameya Velingker, Amir Zandieh |
| 2019 | A sort of an adversary. | Haim Kaplan, Or Zamir, Uri Zwick |
| 2019 | Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. | Haim Kaplan, Lszl Kozma, Or Zamir, Uri Zwick |
| 2019 | On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract. | Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald |
| 2019 | Anaconda: A Non-Adaptive Conditional Sampling Algorithm for Distribution Testing. | Gautam Kamath, Christos Tzamos |
| 2019 | Adaptive Sparse Recovery with Limited Adaptivity. | Akshay Kamath, Eric Price |
| 2019 | A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. | Ce Jin, Hongxun Wu |
| 2019 | Tight Revenue Gaps among Simple Mechanisms. | Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao |
| 2019 | How to guess an n-digit number. | Zilin Jiang, Nikita Polyanskii |
| 2019 | A Faster External Memory Priority Queue with DecreaseKeys. | Shunhua Jiang, Kasper Green Larsen |
| 2019 | Algorithms for #BIS-hard problems on expander graphs. | Matthew Jenssen, Peter Keevash, Will Perkins |
| 2019 | Lower Bounds for Oblivious Data Structures. | Riko Jacob, Kasper Green Larsen, Jesper Buus Nielsen |
| 2019 | A Fourier-Analytic Approach for the Discrepancy of Random Set Systems. | Rebecca Hoberg, Thomas Rothvoss |
| 2019 | Polynomial Planar Directed Grid Theorem. | Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2019 | Oblivious resampling oracles and parallel algorithms for the Lopsided Lovsz Local Lemma. | David G. Harris |
| 2019 | Testing Halfspaces over Rotation-Invariant Distributions. | Nathaniel Harms |
| 2019 | Approximating LCS in Linear Time: Beating the √n Barrier. | MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun |
| 2019 | Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence. | MohammadTaghi Hajiaghayi, Saeed Seddighin, Xiaorui Sun |
| 2019 | On r-Simple k-Path and Related Problems Parameterized by k/r. | Gregory Z. Gutin, Magnus Wahlstrm, Meirav Zehavi |
| 2019 | On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). | Rohit Gurjar, Nisheeth K. Vishnoi |
| 2019 | Popular Matching in Roommates Setting is NP-hard. | Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2019 | Losing Treewidth by Separating Subsets. | Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk |
| 2019 | Elastic Caching. | Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi |
| 2019 | Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. | Andrzej Grzesik, Tereza Klimosov, Marcin Pilipczuk, Michal Pilipczuk |
| 2019 | Analysis of Ward's Method. | Anna Growendt, Heiko Rglin, Melanie Schmidt |