Pages that link to "Item:Q3986106"

The following pages link to A parallel algorithmic version of the local lemma (Q3986106):

Displaying 38 items.

• Random subshifts of finite type (Q414282) (← links)
• Local computation algorithms for graphs of non-constant degrees (Q524360) (← 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)
• Colouring a graph frugally (Q1280272) (← links)
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps (Q1330796) (← links)
• Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
• Hypergraph colouring and the Lovász local lemma (Q1356486) (← links)
• Percolation on finite graphs and isoperimetric inequalities. (Q1878979) (← links)
• Acyclic edge coloring of planar graphs without small cycles (Q1926054) (← links)
• Acyclic edge coloring of graphs with large girths (Q1934376) (← links)
• Acyclic chromatic index of planar graphs with triangles (Q1944145) (← links)
• An improved bound on acyclic chromatic index of planar graphs (Q1945955) (← links)
• Entropy compression versus Lovász local lemma (Q2020021) (← links)
• Local conditions for planar graphs of acyclic edge coloring (Q2142486) (← links)
• Acyclic edge coloring of planar graphs with girth at least 5 (Q2446889) (← links)
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma (Q2487791) (← links)
• The number of disk graphs (Q2509768) (← links)
• Moser-Tardos resampling algorithm, entropy compression method and the subset gas (Q2693173) (← links)
• Acyclic edge colorings of graphs (Q2746208) (← links)
• The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
• An algorithmic approach to the Lovász local lemma. I (Q3986105) (← links)
• The strong chromatic number of a graph (Q3989737) (← links)
• Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
• Near-optimal list colorings (Q4521554) (← links)
• Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs (Q4554943) (← links)
• Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
• A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma (Q4810508) (← links)
• (Q5009540) (← links)
• Counting Solutions to Random CNF Formulas (Q5096442) (← links)
• Counting Hypergraph Colorings in the Local Lemma Regime (Q5232330) (← links)
• Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma (Q5236235) (← links)
• A Local Lemma for Focused Stochastic Algorithms (Q5242924) (← links)
• (Q5743464) (← links)
• Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
• On the benefit of supporting virtual channels in wormhole routers (Q5943124) (← links)
• Connectivity graph-codes (Q6623574) (← links)