David G. Harris

Orcid: 0000-0002-3021-3555

Affiliations:
  • University of Maryland, Department of Computer Science, College Park, USA


According to our database1, David G. Harris authored at least 60 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication.
Algorithmica, September, 2024

A Faster Algorithm for Vertex Cover Parameterized by Solution Size.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel.
Random Struct. Algorithms, October, 2023

Exponentially Faster Massively Parallel Maximal Matching.
J. ACM, October, 2023

On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition.
SIAM J. Discret. Math., June, 2023

Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture.
Random Struct. Algorithms, 2023

Simple and efficient four-cycle counting on sparse graphs.
CoRR, 2023

Parameter Estimation for Gibbs Distributions.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Algorithms for Weighted Independent Transversals and Strong Colouring.
ACM Trans. Algorithms, 2022

Dependent randomized rounding for clustering and partition systems with knapsack constraints.
J. Mach. Learn. Res., 2022

Optimal Bounds for the <i>k</i>-cut Problem.
J. ACM, 2022

2021
Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma.
ACM Trans. Algorithms, 2021

Partial resampling to approximate covering integer programs.
Random Struct. Algorithms, 2021

Improved algorithms for Boolean matrix multiplication via opportunistic matrix multiplication.
CoRR, 2021

A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.
Proceedings of the Approximation, 2021

Approximating Two-Stage Stochastic Supplier Problems.
Proceedings of the Approximation, 2021

2020
Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs.
SIAM J. Comput., 2020

New bounds for the Moser-Tardos distribution.
Random Struct. Algorithms, 2020

Bounds and algorithms for graph trusses.
J. Graph Algorithms Appl., 2020

Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints.
CoRR, 2020

Optimal Bounds for the k-cut Problem.
CoRR, 2020

2019
A Lottery Model for Center-Type Problems With Outliers.
ACM Trans. Algorithms, 2019

Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set.
ACM Trans. Algorithms, 2019

Some Results on Chromatic Number as a Function of Triangle Count.
SIAM J. Discret. Math., 2019

Edge-coloring linear hypergraphs with medium-sized edges.
Random Struct. Algorithms, 2019

Approximation Algorithms for Stochastic Clustering.
J. Mach. Learn. Res., 2019

The Moser-Tardos Framework with Partial Resampling.
J. ACM, 2019

Deterministic Parallel Algorithms for Bilinear Objective Functions.
Algorithmica, 2019

2018
Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma.
ACM Trans. Algorithms, 2018

Improved bounds and algorithms for graph cuts and network reliability.
Random Struct. Algorithms, 2018

Distributed (Δ +1)-Coloring in Sublogarithmic Rounds.
J. ACM, 2018

Distributed approximation algorithms for maximum matching in graphs and hypergraphs.
CoRR, 2018

Bounds and algorithms for k-truss.
CoRR, 2018

On Derandomizing Local Distributed Algorithms.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
A Constructive Lovász Local Lemma for Permutations.
Theory Comput., 2017

Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution.
ACM Trans. Algorithms, 2017

Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs.
ACM Trans. Algorithms, 2017

Symmetric Randomized Dependent Rounding.
CoRR, 2017

Parallel algorithms for the Lopsided Lovász Local Lemma.
CoRR, 2017

2016
On Computing Maximal Independent Sets of Hypergraphs in Parallel.
ACM Trans. Parallel Comput., 2016

Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided Lovász Local Lemma.
ACM Trans. Algorithms, 2016

A note on near-optimal coloring of shift hypergraphs.
Random Struct. Algorithms, 2016

Efficient computation of sparse structures.
Random Struct. Algorithms, 2016

A constructive algorithm for the LLL on permutations.
CoRR, 2016

New bounds for the Moser-Tardos distribution: Beyond the Lovasz Local Lemma.
CoRR, 2016

The Moser-Tardos lopsidependency criterion can be stronger than Shearer's criterion.
CoRR, 2016

Improved parallel algorithms for hypergraph maximal independent set.
CoRR, 2016

Distributed (∆+1)-coloring in sublogarithmic rounds.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015
Distinct Volume Subsets.
SIAM J. Discret. Math., 2015

Improved bounds and parallel algorithms for the Lovasz Local Lemma.
CoRR, 2015

Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs.
Proceedings of the Approximation, 2015

2014
Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial.
Algorithmica, 2014

A constructive algorithm for the Lovász Local Lemma on permutations.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Improved algorithms and analysis for the laminar matroid secretary problem
CoRR, 2013

Constraint satisfaction, packet routing, and the lovasz local lemma.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Efficient Computation of Balanced Structures.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2011
Critique of the related-key attack concept.
Des. Codes Cryptogr., 2011

Linear algebra and sequential importance sampling for network reliability.
Proceedings of the Winter Simulation Conference 2011, 2011

2008
Simultaneous field divisions: an extension of Montgomery's trick.
IACR Cryptol. ePrint Arch., 2008


  Loading...