The following pages link to David G. Harris (Q666680):
Displayed 45 items.
- Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
- Tight bounds and conjectures for the isolation lemma (Q1750661) (← links)
- Comparison of two convergence criteria for the variable-assignment Lopsided Lovász Local Lemma (Q2094876) (← links)
- Critique of the related-key attack concept (Q2430685) (← links)
- Efficient computation of sparse structures (Q2820273) (← links)
- Some Results on Chromatic Number as a Function of Triangle Count (Q3122312) (← links)
- A note on near-optimal coloring of shift hypergraphs (Q3467579) (← links)
- Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs (Q4554943) (← links)
- Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
- Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution (Q4575725) (← links)
- Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma (Q4575819) (← links)
- Improved bounds and algorithms for graph cuts and network reliability (Q4601442) (← links)
- (Q4602400) (← links)
- (Q4608035) (← links)
- Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma (Q4629960) (← links)
- Lopsidependency in the Moser-Tardos Framework (Q4962634) (← links)
- A Lottery Model for Center-Type Problems With Outliers (Q4972682) (← links)
- Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set (Q4972690) (← links)
- A Lottery Model for Center-Type Problems with Outliers (Q5002613) (← links)
- Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma (Q5028338) (← links)
- Optimal Bounds for the <i>k</i> -cut Problem (Q5066939) (← links)
- Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
- Bounds and algorithms for graph trusses (Q5119376) (← links)
- New bounds for the Moser‐Tardos distribution (Q5120743) (← links)
- (Q5214247) (← links)
- The Moser--Tardos Framework with Partial Resampling (Q5215465) (← links)
- Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma (Q5236235) (← links)
- Edge‐coloring linear hypergraphs with medium‐sized edges (Q5236928) (← links)
- Distinct Volume Subsets (Q5251621) (← links)
- Efficient Computation of Balanced Structures (Q5327467) (← links)
- Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovász Local Lemma (Q5363066) (← links)
- Improved bounds and algorithms for graph cuts and network reliability (Q5383978) (← links)
- A constructive algorithm for the Lovász Local Lemma on permutations (Q5384029) (← links)
- Constraint satisfaction, packet routing, and the lovasz local lemma (Q5495839) (← links)
- Algorithms for Weighted Independent Transversals and Strong Colouring (Q6058228) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
- Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture (Q6077050) (← links)
- (Q6090898) (← links)
- A New Notion of Commutativity for the Algorithmic Lovász Local Lemma (Q6090906) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- (Q6147290) (← links)
- Comparison of two convergence criteria for the variable-assignment Lopsided Lovasz Local Lemma (Q6278369) (← links)
- A constructive algorithm for the LLL on permutations (Q6280600) (← links)
- The Combinatorial Data Fusion Problem in Conflicted-supervised Learning (Q6307153) (← links)
- Parameter estimation for integer-valued Gibbs distributions (Q6316757) (← links)