Simultaneous field divisions: an extension of Montgomery's trick. - David G. Harris 001 (IACR Cryptol. ePrint Arch., 2008)

Linear algebra and sequential importance sampling for network reliability. - David G. Harris 001; Francis Sullivan; Isabel Beichl (WSC, 2011)

Critique of the related-key attack concept. - David G. Harris 001 (Des. Codes Cryptogr., 2011)

Efficient Computation of Balanced Structures. - David G. Harris 001; Ehab Morsy; Gopal Pandurangan; Peter Robinson 002; Aravind Srinivasan (ICALP (2), 2013)

Constraint satisfaction, packet routing, and the lovasz local lemma. - David G. Harris 001; Aravind Srinivasan (STOC, 2013)

Improved algorithms and analysis for the laminar matroid secretary problem - David G. Harris 001; Manish Purohit (CoRR, 2013)

A constructive algorithm for the Lovász Local Lemma on permutations. - David G. Harris 001; Aravind Srinivasan (SODA, 2014)

Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial. - David G. Harris 001; Francis Sullivan; Isabel Beichl (Algorithmica, 2014)

Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs. - David G. Harris 001; Francis Sullivan (APPROX-RANDOM, 2015)

Improved bounds and parallel algorithms for the Lovasz Local Lemma. - Bernhard Haeupler; David G. Harris 001 (CoRR, 2015)

Distinct Volume Subsets. - David Conlon; Jacob Fox; William I. Gasarch; David G. Harris 001; Douglas Ulrich; Samuel Zbarsky (SIAM J. Discret. Math., 2015)

Algorithms and Generalizations for the Lovasz Local Lemma. - David G. Harris 001 (2015)

Distributed (∆+1)-coloring in sublogarithmic rounds. - David G. Harris 001; Johannes Schneider 002; Hsin-Hao Su (STOC, 2016)

Improved parallel algorithms for hypergraph maximal independent set. - David G. Harris 001 (CoRR, 2016)

The Moser-Tardos lopsidependency criterion can be stronger than Shearer's criterion. - David G. Harris 001 (CoRR, 2016)

New bounds for the Moser-Tardos distribution: Beyond the Lovasz Local Lemma. - David G. Harris 001 (CoRR, 2016)

A constructive algorithm for the LLL on permutations. - David G. Harris 001; Aravind Srinivasan (CoRR, 2016)

Efficient computation of sparse structures. - David G. Harris 001; Ehab Morsy; Gopal Pandurangan; Peter Robinson 002; Aravind Srinivasan (Random Struct. Algorithms, 2016)

A note on near-optimal coloring of shift hypergraphs. - David G. Harris 001; Aravind Srinivasan (Random Struct. Algorithms, 2016)

Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided Lovász Local Lemma. - David G. Harris 001 (ACM Trans. Algorithms, 2016)

On Computing Maximal Independent Sets of Hypergraphs in Parallel. - Ioana Oriana Bercea; Navin Goyal; David G. Harris 001; Aravind Srinivasan (ACM Trans. Parallel Comput., 2016)

Parallel algorithms for the Lopsided Lovász Local Lemma. - David G. Harris 001 (CoRR, 2017)

Symmetric Randomized Dependent Rounding. - David G. Harris 001; Thomas W. Pensyl; Aravind Srinivasan; Khoa Trinh (CoRR, 2017)

Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs. - Bernhard Haeupler; David G. Harris 001 (ACM Trans. Algorithms, 2017)

Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. - David G. Harris 001; Aravind Srinivasan (ACM Trans. Algorithms, 2017)

A Constructive Lovász Local Lemma for Permutations. - David G. Harris 001; Aravind Srinivasan (Theory Comput., 2017)

On Derandomizing Local Distributed Algorithms. - Mohsen Ghaffari 001; David G. Harris 001; Fabian Kuhn (FOCS, 2018)

Bounds and algorithms for k-truss. - Paul Burkhardt; Vance Faber; David G. Harris 001 (CoRR, 2018)

Distributed approximation algorithms for maximum matching in graphs and hypergraphs. - David G. Harris 001 (CoRR, 2018)

Distributed (Δ +1)-Coloring in Sublogarithmic Rounds. - David G. Harris 001; Johannes Schneider 002; Hsin-Hao Su (J. ACM, 2018)

Improved bounds and algorithms for graph cuts and network reliability. - David G. Harris 001; Aravind Srinivasan (Random Struct. Algorithms, 2018)

Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma. - David G. Harris 001 (ACM Trans. Algorithms, 2018)

Deterministic Parallel Algorithms for Bilinear Objective Functions. - David G. Harris 001 (Algorithmica, 2019)

The Moser-Tardos Framework with Partial Resampling. - David G. Harris 001; Aravind Srinivasan (J. ACM, 2019)

Approximation Algorithms for Stochastic Clustering. - David G. Harris 001; Shi Li 001; Thomas W. Pensyl; Aravind Srinivasan; Khoa Trinh (J. Mach. Learn. Res., 2019)

Edge-coloring linear hypergraphs with medium-sized edges. - Vance Faber; David G. Harris 001 (Random Struct. Algorithms, 2019)

Some Results on Chromatic Number as a Function of Triangle Count. - David G. Harris 001 (SIAM J. Discret. Math., 2019)

Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set. - David G. Harris 001 (ACM Trans. Algorithms, 2019)

A Lottery Model for Center-Type Problems With Outliers. - David G. Harris 001; Thomas W. Pensyl; Aravind Srinivasan; Khoa Trinh (ACM Trans. Algorithms, 2019)

Optimal Bounds for the k-cut Problem. - Anupam Gupta 001; David G. Harris 001; Euiwoong Lee; Jason Li 006 (CoRR, 2020)

Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints. - Brian Brubach; Nathaniel Grammel; David G. Harris 001; Aravind Srinivasan; Leonidas Tsepenekas; Anil Vullikanti (CoRR, 2020)

Bounds and algorithms for graph trusses. - Paul Burkhardt; Vance Faber; David G. Harris 001 (J. Graph Algorithms Appl., 2020)

New bounds for the Moser-Tardos distribution. - David G. Harris 001 (Random Struct. Algorithms, 2020)

Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs. - David G. Harris 001 (SIAM J. Comput., 2020)

Approximating Two-Stage Stochastic Supplier Problems. - Brian Brubach; Nathaniel Grammel; David G. Harris 001; Aravind Srinivasan; Leonidas Tsepenekas; Anil Vullikanti (APPROX-RANDOM, 2021)

A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. - David G. Harris 001; Fotis Iliopoulos; Vladimir Kolmogorov (APPROX-RANDOM, 2021)

Improved algorithms for Boolean matrix multiplication via opportunistic matrix multiplication. - David G. Harris 001 (CoRR, 2021)

Partial resampling to approximate covering integer programs. - Antares Chen; David G. Harris 001; Aravind Srinivasan (Random Struct. Algorithms, 2021)

Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma. - David G. Harris 001 (ACM Trans. Algorithms, 2021)

Optimal Bounds for the k-cut Problem. - Anupam Gupta 001; David G. Harris 001; Euiwoong Lee; Jason Li 006 (J. ACM, 2022)

Dependent randomized rounding for clustering and partition systems with knapsack constraints. - David G. Harris 001; Thomas W. Pensyl; Aravind Srinivasan; Khoa Trinh (J. Mach. Learn. Res., 2022)

Algorithms for Weighted Independent Transversals and Strong Colouring. - Alessandra Graf; David G. Harris 001; Penny Haxell (ACM Trans. Algorithms, 2022)

Simple and efficient four-cycle counting on sparse graphs. - Paul Burkhardt; David G. Harris 001 (CoRR, 2023)

Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture. - Nikhil Bansal 001; David G. Harris 001 (Random Struct. Algorithms, 2023)

On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. - David G. Harris 001; Hsin-Hao Su; Hoa T. Vu (SIAM J. Discret. Math., 2023)

Exponentially Faster Massively Parallel Maximal Matching. - Soheil Behnezhad; MohammadTaghi Hajiaghayi; David G. Harris 001 (J. ACM, 2023)

Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel. - David G. Harris 001 (Random Struct. Algorithms, 2023)

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time. - David G. Harris 001 (SODA, 2024)

A Faster Algorithm for Vertex Cover Parameterized by Solution Size. - David G. Harris 001; N. S. Narayanaswamy (STACS, 2024)

Improved Parallel Derandomization via Finite Automata with Applications. - Jeff Giliberti; David G. Harris 001 (CoRR, 2024)

Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication. - David G. Harris 001 (Algorithmica, 2024)

Parameter Estimation for Gibbs Distributions. - David G. Harris 001; Vladimir Kolmogorov (ACM Trans. Algorithms, 2025)

Simple parallel estimation of the partition ratio for Gibbs distributions. - David G. Harris 001; Vladimir Kolmogorov (CoRR, 2025)