| On derandomizing local distributed algorithms M Ghaffari, DG Harris, F Kuhn 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 126 | 2018 |
| Distributed (Δ+1)-coloring in sublogarithmic rounds DG Harris, J Schneider, HH Su Journal of the ACM 65 (4), Article #19, 2018 | 111* | 2018 |
| 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 | 78 | 2003 |
| Exponentially faster massively parallel maximal matching S Behnezhad, MT Hajiaghayi, DG Harris Journal of the ACM 70 (5), Article #34, 2023 | 65* | 2023 |
| The Moser-Tardos framework with partial resampling DG Harris, A Srinivasan Journal of the ACM 66 (4), Article #37, 2019 | 57* | 2019 |
| A constructive Lovász Local Lemma for permutations DG Harris, A Srinivasan Theory of Computing 13 (17), 1-41, 2017 | 53* | 2017 |
| Distributed local approximation algorithms for maximum matching in graphs and hypergraphs DG Harris SIAM Journal on Computing 49 (4), 711-746, 2020 | 48 | 2020 |
| 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 | 47 | 2015 |
| 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 | 46 | 2019 |
| 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 | 38 | 2016 |
| Improved bounds and algorithms for graph cuts and network reliability DG Harris, A Srinivasan Random Structures & Algorithms 52 (1), 74-135, 2018 | 24 | 2018 |
| Partial resampling to approximate covering integer programs A Chen, DG Harris, A Srinivasan Random Structures & Algorithms 58 (1), 68-93, 2021 | 21* | 2021 |
| Algorithmic and enumerative aspects of the Moser-Tardos distribution DG Harris, A Srinivasan ACM Transactions on Algorithms (TALG) 13 (3), Article #33, 2017 | 21 | 2017 |
| 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 | 20* | 2017 |
| Approximation algorithms for stochastic clustering D Harris, S Li, A Srinivasan, K Trinh, T Pensyl Journal of Machine Learning Research 20 (153), 2019 | 18 | 2019 |
| New bounds for the Moser-Tardos distribution DG Harris Random Structures & Algorithms 57 (1), 97-131, 2020 | 17* | 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 | 16 | 2016 |
| 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 | 16 | 2013 |
| Deterministic algorithms for the Lovász local lemma: simpler, more general, and more parallel DG Harris Random Structures & Algorithms 63 (3), 716-752, 2023 | 14* | 2023 |
| Some results on chromatic number as a function of triangle count DG Harris SIAM Journal on Discrete Mathematics 33 (1), 546-563, 2016 | 14 | 2016 |
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of Maryland在 umd.edu 的电子邮件经过验证
