| 2026 | ICALP | The Dirichlet Mechanism for Rounding with Strong Negative Correlation, with Applications. | David G. Harris, George Z. Li, Nitya Raju, Renata Valieva |
| 2026 | SPAA | Near-Optimal Parallel Approximate Counting via Sampling. | David G. Harris, Vladimir Kolmogorov, Hongyang Liu, Yitong Yin, Yiyao Zhang |
| 2025 | ESA | Improved Parallel Derandomization via Finite Automata with Applications. | Jeff Giliberti, David G. Harris |
| 2024 | SODA | Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time. | David G. Harris |
| 2024 | STACS | A Faster Algorithm for Vertex Cover Parameterized by Solution Size. | David G. Harris, N. S. Narayanaswamy |
| 2023 | ESA | Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication. | David G. Harris |
| 2023 | ICALP | Parameter Estimation for Gibbs Distributions. | David G. Harris, Vladimir Kolmogorov |
| 2022 | SODA | Deterministic algorithms for the Lovsz Local Lemma: simpler, more general, and more parallel. | David G. Harris |
| 2021 | PODC | On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. | David G. Harris, Hsin-Hao Su, Hoa T. Vu |
| 2021 | SODA | Algorithms for weighted independent transversals and strong colouring. | Alessandra Graf, David G. Harris, Penny Haxell |
| 2020 | AISTATS | Dependent randomized rounding for clustering and partition systems with knapsack constraints. | David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh |
| 2019 | FOCS | Exponentially Faster Massively Parallel Maximal Matching. | Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris |
| 2019 | FOCS | Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs. | David G. Harris |
| 2019 | SODA | Oblivious resampling oracles and parallel algorithms for the Lopsided Lovsz Local Lemma. | David G. Harris |
| 2018 | FOCS | On Derandomizing Local Distributed Algorithms. | Mohsen Ghaffari, David G. Harris, Fabian Kuhn |
| 2018 | SODA | Derandomized concentration bounds for polynomials, and hypergraph maximal independent set. | David G. Harris |
| 2017 | SODA | Parallel algorithms and concentration bounds for the Lovsz Local Lemma via witness-DAGs. | Bernhard Haeupler, David G. Harris |
| 2017 | SODA | Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovsz Local Lemma. | David G. Harris |
| 2016 | SODA | Partial Resampling to Approximate Covering Integer Programs. | Antares Chen, David G. Harris, Aravind Srinivasan |
| 2016 | SODA | Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. | David G. Harris, Aravind Srinivasan |
| 2016 | STOC | Distributed (∆+1)-coloring in sublogarithmic rounds. | David G. Harris, Johannes Schneider, Hsin-Hao Su |
| 2015 | SODA | Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovsz Local Lemma. | David G. Harris |
| 2014 | SODA | Improved bounds and algorithms for graph cuts and network reliability. | David G. Harris, Aravind Srinivasan |
| 2014 | SODA | A constructive algorithm for the Lovsz Local Lemma on permutations. | David G. Harris, Aravind Srinivasan |
| 2014 | SPAA | On computing maximal independent sets of hypergraphs in parallel. | Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan |
| 2013 | FOCS | The Moser-Tardos Framework with Partial Resampling. | David G. Harris, Aravind Srinivasan |
| 2013 | ICALP | Efficient Computation of Balanced Structures. | David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan |
| 2013 | STOC | Constraint satisfaction, packet routing, and the lovasz local lemma. | David G. Harris, Aravind Srinivasan |
| 2011 | WSC | Linear algebra and sequential importance sampling for network reliability. | David G. Harris, Francis Sullivan, Isabel Beichl |