Pages that link to "Item:Q2377267"
From MaRDI portal
The following pages link to Distributed computing with advice: information sensitivity of graph coloring (Q2377267):
Displayed 8 items.
- Topology recognition with advice (Q259077) (← links)
- Drawing maps with advice (Q433400) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Communication algorithms with advice (Q972382) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- The ANTS problem (Q2401118) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)