Pages that link to "Item:Q3977297"
From MaRDI portal
The following pages link to A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring (Q3977297):
Displaying 13 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)
- (Q5002725) (← 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)
