Pages that link to "Item:Q3986105"

The following pages link to An algorithmic approach to the Lovász local lemma. I (Q3986105):

Displaying 50 items.

• An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231) (← links)
• Bandwidth and low dimensional embedding (Q388456) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
• A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming (Q507445) (← links)
• Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
• Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
• On existence theorems (Q686508) (← links)
• A Kolmogorov complexity proof of the Lovász local lemma for satisfiability (Q690463) (← links)
• Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas (Q743431) (← links)
• Coloring and the Lovász local lemma (Q847296) (← links)
• Asymptotically optimal frugal colouring (Q965250) (← links)
• Efficient delay routing (Q1128715) (← links)
• Colouring a graph frugally (Q1280272) (← links)
• Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
• Covering with Latin transversals (Q1345959) (← links)
• Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
• Hypergraph colouring and the Lovász local lemma (Q1356486) (← links)
• Independent transversals in \(r\)-partite graphs (Q1377695) (← links)
• Reroute sequence planning in telecommunication networks and compact vector summation. (Q1428596) (← links)
• Testing hypergraph colorability (Q1770424) (← links)
• Choosability in random hypergraphs (Q1850565) (← links)
• Entropy compression versus Lovász local lemma (Q2020021) (← links)
• Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
• Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem (Q2303689) (← links)
• Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
• Rainbow Hamilton cycles and lopsidependency (Q2400558) (← links)
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma (Q2487791) (← links)
• Moser-Tardos resampling algorithm, entropy compression method and the subset gas (Q2693173) (← links)
• Acyclic edge colorings of graphs (Q2746208) (← links)
• Bandwidth and Low Dimensional Embedding (Q3088081) (← links)
• Colouring Non-sparse Random Intersection Graphs (Q3182958) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• Arithmetic Progressions and Tic-Tac-Toe Games (Q3530426) (← links)
• The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
• Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
• Near-optimal list colorings (Q4521554) (← links)
• Coloring bipartite hypergraphs (Q4645934) (← links)
• The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1 (Q4680406) (← links)
• Finding independent transversals efficiently (Q4987260) (← links)
• (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
• (Q5009540) (← links)
• (Q5743464) (← links)
• (Q5869336) (← links)
• Local embeddings of metric spaces (Q5919791) (← links)
• Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
• The role assignment model nearly fits most social networks (Q5939411) (← links)
• On the benefit of supporting virtual channels in wormhole routers (Q5943124) (← links)
• Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
• Coloring fast without learning your neighbors' colors (Q6535038) (← links)