Pages that link to "Item:Q5419030"

The following pages link to Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time (Q5419030):

Displaying 17 items.

• Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
• Almost global problems in the LOCAL model (Q1981631) (← links)
• Linial for lists (Q2104037) (← links)
• Distributed algorithms for fractional coloring (Q2117704) (← links)
• Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
• Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
• Near-linear convergence of the random Osborne algorithm for matrix balancing (Q2687049) (← links)
• An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
• Almost global problems in the LOCAL model (Q5090898) (← links)
• When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
• Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
• Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
• Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
• Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
• Making local algorithms wait-free: the case of ring coloring (Q5920224) (← links)
• A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
• Node and edge averaged complexities of local graph problems (Q6071120) (← links)