David G. Harris

107 papers A* 21A 4B 1Misc 1Journal 74Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Scalable Algorithms for Approximate DNF Model Counting. CoRR Paul Burkhardt, David G. Harris, Kevin T. Schmitt
2025	J	`jnl`	A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. Theory Comput. David G. Harris, Fotios Iliopoulos, Vladimir Kolmogorov
2025	A	`conf`	Improved Parallel Derandomization via Finite Automata with Applications. ESA Jeff Giliberti, David G. Harris
2025	J	`jnl`	Parameter Estimation for Gibbs Distributions. ACM Trans. Algorithms David G. Harris, Vladimir Kolmogorov
2024	A	`conf`	A Faster Algorithm for Vertex Cover Parameterized by Solution Size. STACS David G. Harris, N. S. Narayanaswamy
2024	J	`jnl`	Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication. Algorithmica David G. Harris
2024	A*	`conf`	Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time. SODA David G. Harris
2024	J	`jnl`	Improved Parallel Derandomization via Finite Automata with Applications. CoRR Jeff Giliberti, David G. Harris
2023	A	`conf`	Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication. ESA David G. Harris
2023	J	`jnl`	Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time. CoRR David G. Harris
2023	J	`jnl`	Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel. Random Struct. Algorithms David G. Harris
2023	J	`jnl`	Exponentially Faster Massively Parallel Maximal Matching. J. ACM Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris
2023	J	`jnl`	On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. SIAM J. Discret. Math. David G. Harris, Hsin-Hao Su, Hoa T. Vu
2023	A*	`conf`	Parameter Estimation for Gibbs Distributions. ICALP David G. Harris, Vladimir Kolmogorov
2023	J	`jnl`	Simple and efficient four-cycle counting on sparse graphs. CoRR Paul Burkhardt, David G. Harris
2023	J	`jnl`	Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture. Random Struct. Algorithms Nikhil Bansal, David G. Harris
2022	J	`jnl`	A faster algorithm for Vertex Cover parameterized by solution size. CoRR David G. Harris, N. S. Narayanaswamy
2022	J	`jnl`	Algorithms for Weighted Independent Transversals and Strong Colouring. ACM Trans. Algorithms Alessandra Graf, David G. Harris, Penny Haxell
2022	J	`jnl`	Dependent randomized rounding for clustering and partition systems with knapsack constraints. J. Mach. Learn. Res. David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2022	A*	`conf`	Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallel. SODA David G. Harris
2022	J	`jnl`	Optimal Bounds for the J. ACM Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li
2021	—	`conf`	A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. APPROX-RANDOM David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov
2021	A*	`conf`	Algorithms for weighted independent transversals and strong colouring. SODA Alessandra Graf, David G. Harris, Penny Haxell
2021	—	`conf`	Approximating Two-Stage Stochastic Supplier Problems. APPROX-RANDOM Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2021	J	`jnl`	Improved algorithms for Boolean matrix multiplication via opportunistic matrix multiplication. CoRR David G. Harris
2021	J	`jnl`	Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma. ACM Trans. Algorithms David G. Harris
2021	A*	`conf`	On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. PODC David G. Harris, Hsin-Hao Su, Hoa T. Vu
2021	J	`jnl`	Partial resampling to approximate covering integer programs. Random Struct. Algorithms Antares Chen, David G. Harris, Aravind Srinivasan
2020	J	`jnl`	A new notion of commutativity for the algorithmic Lovász Local Lemma. CoRR David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov
2020	J	`jnl`	Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints. CoRR Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2020	J	`jnl`	Bounds and algorithms for graph trusses. J. Graph Algorithms Appl. Paul Burkhardt, Vance Faber, David G. Harris
2020	A	`conf`	Dependent randomized rounding for clustering and partition systems with knapsack constraints. AISTATS David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2020	J	`jnl`	Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs. SIAM J. Comput. David G. Harris
2020	J	`jnl`	New bounds for the Moser-Tardos distribution. Random Struct. Algorithms David G. Harris
2020	J	`jnl`	On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. CoRR David G. Harris, Hsin-Hao Su, Hoa T. Vu
2020	J	`jnl`	Optimal Bounds for the k-cut Problem. CoRR Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li
2020	J	`jnl`	Parameter estimation for Gibbs distributions. CoRR David G. Harris, Vladimir Kolmogorov
2020	J	`jnl`	Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture. CoRR Nikhil Bansal, David G. Harris
2019	J	`jnl`	A Lottery Model for Center-Type Problems With Outliers. ACM Trans. Algorithms David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2019	J	`jnl`	Algorithms for weighted independent transversals and strong colouring. CoRR Alessandra Graf, David G. Harris, Penny Haxell
2019	J	`jnl`	Approximation Algorithms for Stochastic Clustering. J. Mach. Learn. Res. David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2019	J	`jnl`	Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set. ACM Trans. Algorithms David G. Harris
2019	J	`jnl`	Deterministic Parallel Algorithms for Bilinear Objective Functions. Algorithmica David G. Harris
2019	J	`jnl`	Deterministic algorithms for the Lovasz Local Lemma: simpler, more general, and more parallel. CoRR David G. Harris
2019	A*	`conf`	Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs. FOCS David G. Harris
2019	J	`jnl`	Edge-coloring linear hypergraphs with medium-sized edges. Random Struct. Algorithms Vance Faber, David G. Harris
2019	A*	`conf`	Exponentially Faster Massively Parallel Maximal Matching. FOCS Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris
2019	J	`jnl`	Exponentially Faster Massively Parallel Maximal Matching. CoRR Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris
2019	A*	`conf`	Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma. SODA David G. Harris
2019	J	`jnl`	Some Results on Chromatic Number as a Function of Triangle Count. SIAM J. Discret. Math. David G. Harris
2019	J	`jnl`	The Moser-Tardos Framework with Partial Resampling. J. ACM David G. Harris, Aravind Srinivasan
2018	A*	`conf`	Approximation algorithms for stochastic clustering. NeurIPS David G. Harris, Shi Li, Aravind Srinivasan, Khoa Trinh, Thomas W. Pensyl
2018	J	`jnl`	Approximation algorithms for stochastic clustering. CoRR David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2018	J	`jnl`	Bounds and algorithms for k-truss. CoRR Paul Burkhardt, Vance Faber, David G. Harris
2018	A*	`conf`	Derandomized concentration bounds for polynomials, and hypergraph maximal independent set. SODA David G. Harris
2018	J	`jnl`	Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma. ACM Trans. Algorithms David G. Harris
2018	J	`jnl`	Distributed (Δ +1)-Coloring in Sublogarithmic Rounds. J. ACM David G. Harris, Johannes Schneider, Hsin-Hao Su
2018	J	`jnl`	Distributed approximation algorithms for maximum matching in graphs and hypergraphs. CoRR David G. Harris
2018	J	`jnl`	Improved bounds and algorithms for graph cuts and network reliability. Random Struct. Algorithms David G. Harris, Aravind Srinivasan
2018	A*	`conf`	On Derandomizing Local Distributed Algorithms. FOCS Mohsen Ghaffari, David G. Harris, Fabian Kuhn
2017	J	`jnl`	A Constructive Lovász Local Lemma for Permutations. Theory Comput. David G. Harris, Aravind Srinivasan
2017	—	`conf`	A Lottery Model for Center-Type Problems with Outliers. APPROX-RANDOM David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2017	J	`jnl`	A Lottery Model for Center-type Problems With Outliers. CoRR David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2017	J	`jnl`	Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. ACM Trans. Algorithms David G. Harris, Aravind Srinivasan
2017	J	`jnl`	Deterministic parallel algorithms for bilinear objective functions. CoRR David G. Harris
2017	A*	`conf`	Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma. SODA David G. Harris
2017	J	`jnl`	On Derandomizing Local Distributed Algorithms. CoRR Mohsen Ghaffari, David G. Harris, Fabian Kuhn
2017	J	`jnl`	Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs. ACM Trans. Algorithms Bernhard Haeupler, David G. Harris
2017	A*	`conf`	Parallel algorithms and concentration bounds for the Lovász Local Lemma via witness-DAGs. SODA Bernhard Haeupler, David G. Harris
2017	J	`jnl`	Parallel algorithms for the Lopsided Lovász Local Lemma. CoRR David G. Harris
2017	J	`jnl`	Symmetric Randomized Dependent Rounding. CoRR David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2016	J	`jnl`	A constructive algorithm for the LLL on permutations. CoRR David G. Harris, Aravind Srinivasan
2016	J	`jnl`	A note on near-optimal coloring of shift hypergraphs. Random Struct. Algorithms David G. Harris, Aravind Srinivasan
2016	A*	`conf`	Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. SODA David G. Harris, Aravind Srinivasan
2016	J	`jnl`	Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovasz Local Lemma. CoRR David G. Harris
2016	J	`jnl`	Distributed (Δ+1)-Coloring in Sublogarithmic Rounds. CoRR David G. Harris, Johannes Schneider, Hsin-Hao Su
2016	A*	`conf`	Distributed (∆+1)-coloring in sublogarithmic rounds. STOC David G. Harris, Johannes Schneider, Hsin-Hao Su
2016	J	`jnl`	Efficient computation of sparse structures. Random Struct. Algorithms David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
2016	J	`jnl`	Improved bounds and algorithms for graph cuts and network reliability. CoRR David G. Harris, Aravind Srinivasan
2016	J	`jnl`	Improved parallel algorithms for hypergraph maximal independent set. CoRR David G. Harris
2016	J	`jnl`	Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided Lovász Local Lemma. ACM Trans. Algorithms David G. Harris
2016	J	`jnl`	Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovasz Local Lemma. CoRR David G. Harris
2016	J	`jnl`	New bounds for the Moser-Tardos distribution: Beyond the Lovasz Local Lemma. CoRR David G. Harris
2016	J	`jnl`	On Computing Maximal Independent Sets of Hypergraphs in Parallel. ACM Trans. Parallel Comput. Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan
2016	A*	`conf`	Partial Resampling to Approximate Covering Integer Programs. SODA Antares Chen, David G. Harris, Aravind Srinivasan
2016	J	`jnl`	The Moser-Tardos lopsidependency criterion can be stronger than Shearer's criterion. CoRR David G. Harris
2015	J	`jnl`	Algorithmic and enumerative aspects of the Moser-Tardos distribution. CoRR David G. Harris, Aravind Srinivasan
2015	—	`—`	Algorithms and Generalizations for the Lovasz Local Lemma. David G. Harris
2015	J	`jnl`	Distinct Volume Subsets. SIAM J. Discret. Math. David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Samuel Zbarsky
2015	J	`jnl`	Improved bounds and parallel algorithms for the Lovasz Local Lemma. CoRR Bernhard Haeupler, David G. Harris
2015	A*	`conf`	Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovász Local Lemma. SODA David G. Harris
2015	J	`jnl`	Partial Resampling to Approximate Covering Integer Programs. CoRR Antares Chen, David G. Harris, Aravind Srinivasan
2015	—	`conf`	Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs. APPROX-RANDOM David G. Harris, Francis Sullivan
2014	A*	`conf`	A constructive algorithm for the Lovász Local Lemma on permutations. SODA David G. Harris, Aravind Srinivasan
2014	J	`jnl`	Distinct volume subsets. CoRR David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Sam Zbarsky
2014	J	`jnl`	Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial. Algorithmica David G. Harris, Francis Sullivan, Isabel Beichl
2014	A*	`conf`	Improved bounds and algorithms for graph cuts and network reliability. SODA David G. Harris, Aravind Srinivasan
2014	J	`jnl`	On Computing Maximal Independent Sets of Hypergraphs in Parallel. CoRR Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan
2014	B	`conf`	On computing maximal independent sets of hypergraphs in parallel. SPAA Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan
2014	J	`jnl`	The Moser-Tardos Framework with Partial Resampling. CoRR David G. Harris, Aravind Srinivasan
2013	A*	`conf`	Constraint satisfaction, packet routing, and the lovasz local lemma. STOC David G. Harris, Aravind Srinivasan
2013	—	`conf`	Efficient Computation of Balanced Structures. ICALP (2) David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
2013	J	`jnl`	Improved algorithms and analysis for the laminar matroid secretary problem CoRR David G. Harris, Manish Purohit
2013	A*	`conf`	The Moser-Tardos Framework with Partial Resampling. FOCS David G. Harris, Aravind Srinivasan
2011	J	`jnl`	Critique of the related-key attack concept. Des. Codes Cryptogr. David G. Harris
2011	Misc	`conf`	Linear algebra and sequential importance sampling for network reliability. WSC David G. Harris, Francis Sullivan, Isabel Beichl
2008	J	`jnl`	Simultaneous field divisions: an extension of Montgomery's trick. IACR Cryptol. ePrint Arch. David G. Harris