Pages that link to "Item:Q972382"
From MaRDI portal
The following pages link to Communication algorithms with advice (Q972382):
Displaying 15 items.
- Topology recognition with advice (Q259077) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← 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)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
- Treasure Hunt with Advice (Q3460725) (← links)
- Short labeling schemes for topology recognition in wireless tree networks (Q5915998) (← links)
- Deterministic size discovery and topology recognition in radio networks with short labels (Q6040656) (← 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)
