David Harris
Title
Cited by
Cited by
Year
Conserved fragments of transposable elements in intergenic regions: evidence for widespread recruitment of MIR-and L2-derived sequences within the mouse and human genomes
JC Silva, SA Shabalina, DG Harris, JL Spouge, AS Kondrashov
Genetics Research 82 (1), 1-18, 2003
722003
Distributed (Δ+1)-coloring in sublogarithmic rounds
DG Harris, J Schneider, HH Su
Journal of the ACM 65 (4), Article #19, 2018
71*2018
On derandomizing local distributed algorithms
M Ghaffari, DG Harris, F Kuhn
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
592018
A constructive Lovász Local Lemma for permutations
DG Harris, A Srinivasan
Theory of Computing 13 (17), 1-41, 2017
48*2017
The Moser-Tardos framework with partial resampling
DG Harris, A Srinivasan
Journal of the ACM 66 (4), Article #37, 2019
40*2019
A new method for estimating species age supports the coexistence of malaria parasites and their Mammalian hosts
JC Silva, A Egan, C Arze, JL Spouge, DG Harris
Molecular biology and evolution 32 (5), 1354-1364, 2015
372015
Lopsidependency in the Moser-Tardos framework: beyond the Lopsided Lovász Local Lemma
DG Harris
ACM Transaction on Algorithms (TALG) 13 (1), Article #17, 2016
322016
Exponentially faster massively parallel maximal matching
S Behnezhad, MT Hajiaghayi, DG Harris
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
302019
Distributed local approximation algorithms for maximum matching in graphs and hypergraphs
DG Harris
SIAM Journal on Computing 49 (4), 711-746, 2020
192020
Algorithmic and enumerative aspects of the Moser-Tardos distribution
DG Harris, A Srinivasan
ACM Transactions on Algorithms (TALG) 13 (3), Article #33, 2017
182017
Parallel algorithms and concentration bounds for the Lovász Local Lemma via witness DAGs
B Haeupler, DG Harris
ACM Transactions on Algorithms (TALG) 13 (4), Article #53, 2017
17*2017
Constraint satisfaction, packet routing, and the Lovász Local Lemma
DG Harris, A Srinivasan
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
162013
Improved bounds and algorithms for graph cuts and network reliability
DG Harris, A Srinivasan
Random Structures & Algorithms 52 (1), 74-135, 2018
152018
Partial resampling to approximate covering integer programs
A Chen, DG Harris, A Srinivasan
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
152016
A lottery model for center-type problems with outliers
DG Harris, T Pensyl, A Srinivasan, K Trinh
ACM Transactions on Algorithms 15 (3), Article #36, 2019
142019
New bounds for the Moser-Tardos distribution
DG Harris
Random Structures & Algorithms 57 (1), 97-131, 2020
11*2020
On computing maximal independent sets of hypergraphs in parallel
IO Bercea, N Goyal, DG Harris, A Srinivasan
ACM Transactions on Parallel Computing (TOPC) 13 (1), Article #5, 2016
102016
Distinct volume subsets
D Conlon, J Fox, W Gasarch, DG Harris, D Ulrich, S Zbarsky
SIAM Journal on Discrete Mathematics 29 (1), 472-480, 2015
102015
Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma
DG Harris
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
9*2019
Some results on chromatic number as a function of triangle count
DG Harris
SIAM Journal on Discrete Mathematics 33 (1), 546-563, 2016
82016
The system can't perform the operation now. Try again later.
Articles 1–20