Pages that link to "Item:Q2377267"
From MaRDI portal
The following pages link to Distributed computing with advice: information sensitivity of graph coloring (Q2377267):
Displaying 16 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)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← 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)
- Finding the size and the diameter of a radio network using short labels (Q2661761) (← links)
- Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
- (Q5002836) (← links)
- Introduction to local certification (Q5024672) (← links)
- Short labeling schemes for topology recognition in wireless tree networks (Q5915998) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
- Edge exploration of anonymous graph by mobile agent with external help (Q6488105) (← links)
