default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid G. Harris 0001
Person information
- affiliation: University of Maryland, Department of Computer Science, College Park, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j34]David G. Harris
, Vladimir Kolmogorov:
Parameter Estimation for Gibbs Distributions. ACM Trans. Algorithms 21(1): 3:1-3:39 (2025)- 2024
- [j33]David G. Harris:
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication. Algorithmica 86(9): 2822-2844 (2024) - [c31]David G. Harris:
Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time. SODA 2024: 2275-2304 - [c30]David G. Harris, N. S. Narayanaswamy:
A Faster Algorithm for Vertex Cover Parameterized by Solution Size. STACS 2024: 40:1-40:18 - [i38]Jeff Giliberti, David G. Harris:
Improved Parallel Derandomization via Finite Automata with Applications. CoRR abs/2411.18028 (2024) - 2023
- [j32]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. J. ACM 70(5): 34:1-34:18 (2023) - [j31]Nikhil Bansal, David G. Harris:
Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture. Random Struct. Algorithms 62(1): 52-67 (2023) - [j30]David G. Harris:
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel. Random Struct. Algorithms 63(3): 716-752 (2023) - [j29]David G. Harris, Hsin-Hao Su, Hoa T. Vu:
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. SIAM J. Discret. Math. 37(2): 800-830 (2023) - [c29]David G. Harris:
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication. ESA 2023: 57:1-57:17 - [c28]David G. Harris, Vladimir Kolmogorov:
Parameter Estimation for Gibbs Distributions. ICALP 2023: 72:1-72:21 - [i37]Paul Burkhardt, David G. Harris:
Simple and efficient four-cycle counting on sparse graphs. CoRR abs/2303.06090 (2023) - [i36]David G. Harris:
Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time. CoRR abs/2308.07476 (2023) - 2022
- [j28]Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li:
Optimal Bounds for the k-cut Problem. J. ACM 69(1): 2:1-2:18 (2022) - [j27]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Dependent randomized rounding for clustering and partition systems with knapsack constraints. J. Mach. Learn. Res. 23: 81:1-81:41 (2022) - [j26]Alessandra Graf, David G. Harris, Penny Haxell:
Algorithms for Weighted Independent Transversals and Strong Colouring. ACM Trans. Algorithms 18(1): 1:1-1:16 (2022) - [c27]David G. Harris:
Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallel. SODA 2022: 1744-1779 - [i35]David G. Harris, N. S. Narayanaswamy:
A faster algorithm for Vertex Cover parameterized by solution size. CoRR abs/2205.08022 (2022) - 2021
- [j25]Antares Chen, David G. Harris, Aravind Srinivasan:
Partial resampling to approximate covering integer programs. Random Struct. Algorithms 58(1): 68-93 (2021) - [j24]David G. Harris:
Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma. ACM Trans. Algorithms 17(1): 1:1-1:32 (2021) - [c26]Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Approximating Two-Stage Stochastic Supplier Problems. APPROX-RANDOM 2021: 23:1-23:22 - [c25]David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov:
A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. APPROX-RANDOM 2021: 31:1-31:25 - [c24]David G. Harris, Hsin-Hao Su, Hoa T. Vu:
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. PODC 2021: 295-305 - [c23]Alessandra Graf, David G. Harris, Penny Haxell:
Algorithms for weighted independent transversals and strong colouring. SODA 2021: 662-674 - [i34]David G. Harris:
Improved algorithms for Boolean matrix multiplication via opportunistic matrix multiplication. CoRR abs/2109.13335 (2021) - 2020
- [j23]Paul Burkhardt, Vance Faber, David G. Harris:
Bounds and algorithms for graph trusses. J. Graph Algorithms Appl. 24(3): 191-214 (2020) - [j22]David G. Harris:
New bounds for the Moser-Tardos distribution. Random Struct. Algorithms 57(1): 97-131 (2020) - [j21]David G. Harris:
Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs. SIAM J. Comput. 49(4): 711-746 (2020) - [c22]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Dependent randomized rounding for clustering and partition systems with knapsack constraints. AISTATS 2020: 2273-2283 - [i33]Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li:
Optimal Bounds for the k-cut Problem. CoRR abs/2005.08301 (2020) - [i32]David G. Harris, Vladimir Kolmogorov:
Parameter estimation for Gibbs distributions. CoRR abs/2007.10824 (2020) - [i31]Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints. CoRR abs/2008.03325 (2020) - [i30]David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov:
A new notion of commutativity for the algorithmic Lovász Local Lemma. CoRR abs/2008.05569 (2020) - [i29]David G. Harris, Hsin-Hao Su, Hoa T. Vu:
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. CoRR abs/2009.10761 (2020) - [i28]Nikhil Bansal, David G. Harris:
Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture. CoRR abs/2011.07097 (2020)
2010 – 2019
- 2019
- [j20]David G. Harris:
Deterministic Parallel Algorithms for Bilinear Objective Functions. Algorithmica 81(3): 1288-1318 (2019) - [j19]David G. Harris, Aravind Srinivasan:
The Moser-Tardos Framework with Partial Resampling. J. ACM 66(5): 36:1-36:45 (2019) - [j18]David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Approximation Algorithms for Stochastic Clustering. J. Mach. Learn. Res. 20: 153:1-153:33 (2019) - [j17]Vance Faber, David G. Harris:
Edge-coloring linear hypergraphs with medium-sized edges. Random Struct. Algorithms 55(1): 153-159 (2019) - [j16]David G. Harris:
Some Results on Chromatic Number as a Function of Triangle Count. SIAM J. Discret. Math. 33(1): 546-563 (2019) - [j15]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
A Lottery Model for Center-Type Problems With Outliers. ACM Trans. Algorithms 15(3): 36:1-36:25 (2019) - [j14]David G. Harris:
Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set. ACM Trans. Algorithms 15(3): 43:1-43:29 (2019) - [c21]David G. Harris:
Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs. FOCS 2019: 700-724 - [c20]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. FOCS 2019: 1637-1649 - [c19]David G. Harris:
Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma. SODA 2019: 841-860 - [i27]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. CoRR abs/1901.03744 (2019) - [i26]Alessandra Graf, David G. Harris, Penny Haxell:
Algorithms for weighted independent transversals and strong colouring. CoRR abs/1907.00033 (2019) - [i25]David G. Harris:
Deterministic algorithms for the Lovasz Local Lemma: simpler, more general, and more parallel. CoRR abs/1909.08065 (2019) - 2018
- [j13]David G. Harris, Johannes Schneider, Hsin-Hao Su:
Distributed (Δ +1)-Coloring in Sublogarithmic Rounds. J. ACM 65(4): 19:1-19:21 (2018) - [j12]David G. Harris, Aravind Srinivasan:
Improved bounds and algorithms for graph cuts and network reliability. Random Struct. Algorithms 52(1): 74-135 (2018) - [j11]David G. Harris:
Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma. ACM Trans. Algorithms 14(4): 47:1-47:24 (2018) - [c18]Mohsen Ghaffari, David G. Harris, Fabian Kuhn:
On Derandomizing Local Distributed Algorithms. FOCS 2018: 662-673 - [c17]David G. Harris, Shi Li, Aravind Srinivasan, Khoa Trinh, Thomas W. Pensyl:
Approximation algorithms for stochastic clustering. NeurIPS 2018: 6041-6050 - [c16]David G. Harris:
Derandomized concentration bounds for polynomials, and hypergraph maximal independent set. SODA 2018: 2161-2180 - [i24]Paul Burkhardt, Vance Faber, David G. Harris:
Bounds and algorithms for k-truss. CoRR abs/1806.05523 (2018) - [i23]David G. Harris:
Distributed approximation algorithms for maximum matching in graphs and hypergraphs. CoRR abs/1807.07645 (2018) - [i22]David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Approximation algorithms for stochastic clustering. CoRR abs/1809.02271 (2018) - 2017
- [j10]David G. Harris, Aravind Srinivasan:
Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. ACM Trans. Algorithms 13(3): 33:1-33:40 (2017) - [j9]Bernhard Haeupler, David G. Harris:
Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs. ACM Trans. Algorithms 13(4): 53:1-53:25 (2017) - [j8]David G. Harris, Aravind Srinivasan:
A Constructive Lovász Local Lemma for Permutations. Theory Comput. 13(1): 1-41 (2017) - [c15]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
A Lottery Model for Center-Type Problems with Outliers. APPROX-RANDOM 2017: 10:1-10:19 - [c14]Bernhard Haeupler, David G. Harris:
Parallel algorithms and concentration bounds for the Lovász Local Lemma via witness-DAGs. SODA 2017: 1170-1187 - [c13]David G. Harris:
Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma. SODA 2017: 1188-1203 - [i21]David G. Harris:
Parallel algorithms for the Lopsided Lovász Local Lemma. CoRR abs/1702.02547 (2017) - [i20]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Symmetric Randomized Dependent Rounding. CoRR abs/1709.06995 (2017) - [i19]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
A Lottery Model for Center-type Problems With Outliers. CoRR abs/1710.00287 (2017) - [i18]Mohsen Ghaffari, David G. Harris, Fabian Kuhn:
On Derandomizing Local Distributed Algorithms. CoRR abs/1711.02194 (2017) - [i17]David G. Harris:
Deterministic parallel algorithms for bilinear objective functions. CoRR abs/1711.08494 (2017) - 2016
- [j7]David G. Harris, Aravind Srinivasan:
A note on near-optimal coloring of shift hypergraphs. Random Struct. Algorithms 48(1): 53-56 (2016) - [j6]David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan:
Efficient computation of sparse structures. Random Struct. Algorithms 49(2): 322-344 (2016) - [j5]David G. Harris:
Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided Lovász Local Lemma. ACM Trans. Algorithms 13(1): 17:1-17:26 (2016) - [j4]Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan:
On Computing Maximal Independent Sets of Hypergraphs in Parallel. ACM Trans. Parallel Comput. 3(1): 5:1-5:13 (2016) - [c12]Antares Chen, David G. Harris, Aravind Srinivasan:
Partial Resampling to Approximate Covering Integer Programs. SODA 2016: 1984-2003 - [c11]David G. Harris, Aravind Srinivasan:
Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. SODA 2016: 2004-2023 - [c10]David G. Harris, Johannes Schneider, Hsin-Hao Su:
Distributed (∆+1)-coloring in sublogarithmic rounds. STOC 2016: 465-478 - [i16]David G. Harris, Aravind Srinivasan:
Improved bounds and algorithms for graph cuts and network reliability. CoRR abs/1602.08730 (2016) - [i15]David G. Harris, Johannes Schneider, Hsin-Hao Su:
Distributed (Δ+1)-Coloring in Sublogarithmic Rounds. CoRR abs/1603.01486 (2016) - [i14]David G. Harris:
Improved parallel algorithms for hypergraph maximal independent set. CoRR abs/1609.06156 (2016) - [i13]David G. Harris:
The Moser-Tardos lopsidependency criterion can be stronger than Shearer's criterion. CoRR abs/1610.01926 (2016) - [i12]David G. Harris:
Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovasz Local Lemma. CoRR abs/1610.02420 (2016) - [i11]David G. Harris:
Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovasz Local Lemma. CoRR abs/1610.03383 (2016) - [i10]David G. Harris:
New bounds for the Moser-Tardos distribution: Beyond the Lovasz Local Lemma. CoRR abs/1610.09653 (2016) - [i9]David G. Harris, Aravind Srinivasan:
A constructive algorithm for the LLL on permutations. CoRR abs/1612.02663 (2016) - 2015
- [j3]David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Samuel Zbarsky:
Distinct Volume Subsets. SIAM J. Discret. Math. 29(1): 472-480 (2015) - [c9]David G. Harris, Francis Sullivan:
Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs. APPROX-RANDOM 2015: 323-340 - [c8]David G. Harris:
Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovász Local Lemma. SODA 2015: 1792-1808 - [i8]David G. Harris, Aravind Srinivasan:
Algorithmic and enumerative aspects of the Moser-Tardos distribution. CoRR abs/1507.02674 (2015) - [i7]Antares Chen, David G. Harris, Aravind Srinivasan:
Partial Resampling to Approximate Covering Integer Programs. CoRR abs/1507.07402 (2015) - [i6]Bernhard Haeupler, David G. Harris:
Improved bounds and parallel algorithms for the Lovasz Local Lemma. CoRR abs/1509.06430 (2015) - 2014
- [j2]David G. Harris, Francis Sullivan, Isabel Beichl:
Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial. Algorithmica 68(4): 916-939 (2014) - [c7]David G. Harris, Aravind Srinivasan:
Improved bounds and algorithms for graph cuts and network reliability. SODA 2014: 259-278 - [c6]David G. Harris, Aravind Srinivasan:
A constructive algorithm for the Lovász Local Lemma on permutations. SODA 2014: 907-925 - [c5]Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan:
On computing maximal independent sets of hypergraphs in parallel. SPAA 2014: 42-50 - [i5]David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Sam Zbarsky:
Distinct volume subsets. CoRR abs/1401.6734 (2014) - [i4]Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan:
On Computing Maximal Independent Sets of Hypergraphs in Parallel. CoRR abs/1405.1133 (2014) - [i3]David G. Harris, Aravind Srinivasan:
The Moser-Tardos Framework with Partial Resampling. CoRR abs/1406.5943 (2014) - 2013
- [c4]David G. Harris, Aravind Srinivasan:
The Moser-Tardos Framework with Partial Resampling. FOCS 2013: 469-478 - [c3]David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan:
Efficient Computation of Balanced Structures. ICALP (2) 2013: 581-593 - [c2]David G. Harris, Aravind Srinivasan:
Constraint satisfaction, packet routing, and the lovasz local lemma. STOC 2013: 685-694 - [i2]David G. Harris, Manish Purohit:
Improved algorithms and analysis for the laminar matroid secretary problem. CoRR abs/1301.4958 (2013) - 2011
- [j1]David G. Harris:
Critique of the related-key attack concept. Des. Codes Cryptogr. 59(1-3): 159-168 (2011) - [c1]David G. Harris, Francis Sullivan, Isabel Beichl:
Linear algebra and sequential importance sampling for network reliability. WSC 2011: 3344-3352
2000 – 2009
- 2008
- [i1]David G. Harris:
Simultaneous field divisions: an extension of Montgomery's trick. IACR Cryptol. ePrint Arch. 2008: 199 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
