Pages that link to "Item:Q5964898"
From MaRDI portal
The following pages link to Time versus cost tradeoffs for deterministic rendezvous in networks (Q5964898):
Displaying 12 items.
- Memory optimal dispersion by anonymous mobile robots (Q831752) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Analysis of a randomized rendezvous algorithm (Q1398376) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Asynchronous approach in the plane: a deterministic polynomial algorithm (Q2318113) (← links)
- Deterministic rendezvous with different maps (Q2323344) (← links)
- (Q3077352) (← links)
- Asynchronous Deterministic Rendezvous on the Line (Q3599098) (← links)
- (Q5002836) (← links)
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous (Q5245013) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q6094723) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q6483581) (← links)