Pages that link to "Item:Q5920074"
From MaRDI portal
The following pages link to Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074):
Displaying 15 items.
- Polynomial lower bound for distributed graph coloring in a weak LOCAL model (Q1660925) (← links)
- Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs (Q4554943) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
- (Q5090456) (← links)
- Counting Hypergraph Colorings in the Local Lemma Regime (Q5232330) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5918711) (← links)
- Locally checkable problems in rooted trees (Q6096035) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- Sublogarithmic distributed algorithms for Lovász local lemma, and the complexity hierarchy (Q6487489) (← links)
- The complexity landscape of distributed locally checkable problems on trees (Q6535015) (← links)
- Distributed computing in the asynchronous LOCAL model (Q6652468) (← links)
