Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
David G. Harris
Observed names:
David Harris,
Harris, David,
Harris, David G.,
Harris, David Ibnu
Institutions:
Universitas Pahlawan Tuanku Tambusai,
University of Maryland, College Park
Observed institutions:
Google (United States),
United States Department of Defense,
Universitas Pahlawan Tuanku Tambusai,
University of Maryland, College Park
ORCID:
0000-0002-3021-3555
Observed ORCID:
0000-0002-3021-3555
OpenAlex ID:
A5101783327
On Derandomizing Local Distributed Algorithms
2018
·
Mohsen Ghaffari
, David G. Harris
, et al.
·
Annual Symposium on Foundations of Computer Science
·
200
PDF
Distributed (∆+1)-coloring in sublogarithmic rounds
2016
·
David G. Harris
, Johannes Schneider
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
104
Exponentially Faster Massively Parallel Maximal Matching
2019
·
Soheil Behnezhad
, Mohammad Taghi Hajiaghayi
, et al.
·
Annual Symposium on Foundations of Computer Science
·
80
Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs
2019
·
David G. Harris
·
SIAM Journal on Computing
·
72
PDF
The Moser--Tardos Framework with Partial Resampling
2013
·
David G. Harris
, Aravind Srinivasan
·
Journal of the ACM
·
59
PDF
Distributed (Δ +1)-Coloring in Sublogarithmic Rounds
2018
·
David G. Harris
, Johannes Schneider
, et al.
·
Journal of the ACM
·
58
PDF
A Lottery Model for Center-Type Problems With Outliers
2019
·
David G. Harris
, Thomas Pensyl
, et al.
·
ACM Transactions on Algorithms
·
57
PDF
A Faster Algorithm for Vertex Cover Parameterized by Solution Size
2022
·
Harris, David G.
, Narayanaswamy, N. S.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
43
PDF
A constructive algorithm for the Lovász Local Lemma on permutations
2013
·
David G. Harris
, Aravind Srinivasan
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
38
Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided Lovász Local Lemma
2016
·
David G. Harris
·
ACM Transactions on Algorithms
·
34
PDF
Some Results on Chromatic Number as a Function of Triangle Count
2019
·
David G. Harris
·
SIAM Journal on Discrete Mathematics
·
28
PDF
New bounds for the Moser‐Tardos distribution
2020
·
David G. Harris
·
Random Structures and Algorithms
·
23
PDF
Optimal Bounds for the k -cut Problem
2021
·
Anupam Gupta
, David G. Harris
, et al.
·
Journal of the ACM
·
22
PDF
Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution
2017
·
David G. Harris
, Aravind Srinivasan
·
ACM Transactions on Algorithms
·
21
PDF
Parallel algorithms and concentration bounds for the Lovász Local Lemma via witness-DAGs
2017
·
Bernhard Haeupler
, David G. Harris
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
19
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
2023
·
David G. Harris
·
Random Structures and Algorithms
·
17
PDF
Partial Resampling to Approximate Covering Integer Programs
2015
·
Antares Chen
, David G. Harris
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
17
Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs
2017
·
Bernhard Haeupler
, David G. Harris
·
ACM Transactions on Algorithms
·
16
PDF
Exponentially Faster Massively Parallel Maximal Matching
2023
·
Soheil Behnezhad
, Mohammadtaghi Hajiaghayi
, et al.
·
Journal of the ACM
·
15
PDF
Untitled
2017
·
David G. Harris
, Aravind Srinivasan
·
Theory of Computing
·
15
PDF
Constraint satisfaction, packet routing, and the lovasz local lemma
2013
·
David G. Harris
, Aravind Srinivasan
·
ACM Symposium on Theory of Computing (STOC)
·
15
Approximation algorithms for stochastic clustering
2018
·
Harris, David G.
, Li, Shi
, et al.
·
arXiv (Cornell University)
·
14
PDF
Parameter Estimation for Gibbs Distributions
2024
·
David G. Harris
, Vladimir Kolmogorov
·
ACM Transactions on Algorithms
·
13
PDF
Algorithms for Weighted Independent Transversals and Strong Colouring
2021
·
Alessandra Graf
, David G. Harris
, et al.
·
ACM Transactions on Algorithms
·
11
PDF
Bounds and algorithms for graph trusses
2020
·
Paul Burkhardt
, Vance Faber
, et al.
·
Journal of Graph Algorithms and Applications
·
11
Show more works
View as search
Works count:
91
Citation count:
1,244
H-index:
17
I10-index:
31
Year
Topic
Type