Pages that link to "Item:Q6487489"

The following pages link to Sublogarithmic distributed algorithms for Lovász local lemma, and the complexity hierarchy (Q6487489):

Displaying 19 items.

• Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
• Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
• Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms (Q2684542) (← links)
• Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
• Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 (Q2693035) (← links)
• Equivariant maps to subshifts whose points have small stabilizers (Q2699496) (← links)
• An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
• A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
• Finding independent transversals efficiently (Q4987260) (← links)
• (Q5090456) (← links)
• Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
• Factor-of-iid balanced orientation of non-amenable graphs (Q6057456) (← links)
• Node and edge averaged complexities of local graph problems (Q6071120) (← links)
• Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)
• Locally checkable problems in rooted trees (Q6096035) (← links)
• Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
• Component stability in low-space massively parallel computation (Q6126138) (← links)
• Distributed coloring of hypergraphs (Q6188146) (← links)
• Distributed Symmetry Breaking on Power Graphs via Sparsification (Q6202239) (← links)