Pages that link to "Item:Q3977297"

The following pages link to A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring (Q3977297):

Displaying 25 items.

• Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
• Finitely dependent processes are finitary (Q782416) (← links)
• Linial for lists (Q2104037) (← links)
• Mallows permutations and finite dependence (Q2184821) (← links)
• Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
• Randomized distributed decision (Q2256969) (← links)
• Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← links)
• Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
• FINITELY DEPENDENT COLORING (Q2971028) (← links)
• Exact Bounds for Distributed Graph Colouring (Q3460706) (← links)
• Leveraging Linial’s Locality Limit (Q3540245) (← links)
• Local-Global Phenomena in Graphs (Q4290099) (← 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)
• (Q5002725) (← links)
• Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
• Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
• How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
• Node and edge averaged complexities of local graph problems (Q6071120) (← links)
• Locally checkable problems in rooted trees (Q6096035) (← links)
• Distributed half-integral matching and beyond (Q6199402) (← links)
• Local conflict coloring revisited: Linial for lists (Q6535013) (← links)
• Classification of distributed binary labeling problems (Q6535014) (← links)
• Improved distributed approximations for maximum independent set (Q6535034) (← links)
• Symmetrization for finitely dependent colouring (Q6616316) (← links)