| 2019 | Dynamic Edge Coloring with Improved Approximation. | Ran Duan, Haoqing He, Tianyi Zhang |
| 2019 | List Decoding with Double Samplers. | Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma |
| 2019 | Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]. | Irit Dinur, Yuval Filmus, Prahladh Harsha |
| 2019 | Efficient Algorithms and Lower Bounds for Robust Linear Regression. | Ilias Diakonikolas, Weihao Kong, Alistair Stewart |
| 2019 | Computing Height Persistence and Homology Generators in R | Tamal K. Dey |
| 2019 | The threshold for SDP-refutation of random regular NAE-3SAT. | Yash Deshpande, Andrea Montanari, Ryan O'Donnell, Tselil Schramm, Subhabrata Sen |
| 2019 | A Framework for Searching in Graphs in the Presence of Errors. | Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, Daniel Wolleb-Graf |
| 2019 | Multi-unit Supply-monotone Auctions with Bayesian Valuations. | Yuan Deng, Debmalya Panigrahi |
| 2019 | Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. | Wojciech Czerwinski, Laure Daviaud, Nathanal Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys |
| 2019 | Prophet Secretary Through Blind Strategies. | Jos Correa, Raimundo Saona, Bruno Ziliotto |
| 2019 | On the rank of a random binary matrix. | Colin Cooper, Alan M. Frieze, Wesley Pegden |
| 2019 | Lower bounds for text indexing with mismatches and differences. | Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya |
| 2019 | The streaming k-mismatch problem. | Raphal Clifford, Tomasz Kociumaka, Ely Porat |
| 2019 | Towards Tight(er) Bounds for the Excluded Grid Theorem. | Julia Chuzhoy, Zihan Tan |
| 2019 | Improved Topological Approximations by Digitization. | Aruni Choudhary, Michael Kerber, Sharath Raghvendra |
| 2019 | An Equivalence Class for Orthogonal Vectors. | Lijie Chen, Ryan Williams |
| 2019 | Fine-grained Complexity Meets IP = PSPACE. | Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein |
| 2019 | Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets. | Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu |
| 2019 | Improved Bounds for Randomly Sampling Colorings via Linear Programming. | Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle |
| 2019 | Derandomized Balanced Allocation. | Xue Chen |
| 2019 | On Approximating (Sparse) Covering Integer Programs. | Chandra Chekuri, Kent Quanrud |
| 2019 | Submodular Function Maximization in Parallel via the Multilinear Relaxation. | Chandra Chekuri, Kent Quanrud |
| 2019 | LP Relaxation and Tree Packing for Minimum k-cuts. | Chandra Chekuri, Kent Quanrud, Chao Xu |
| 2019 | Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms. | Yeow Meng Chee, Duc Tu Dao, Han Mao Kiah, San Ling, Hengjia Wei |
| 2019 | Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model. | Shiri Chechik, Doron Mukhtar |