Pages that link to "Item:Q3540234"
From MaRDI portal
The following pages link to Deterministic Rendezvous in Trees with Little Memory (Q3540234):
Displayed 17 items.
- Anonymous meeting in networks (Q262278) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Rendezvous of heterogeneous mobile agents in edge-weighted networks (Q896142) (← links)
- Quiescence of self-stabilizing gossiping among mobile agents in graphs (Q962163) (← links)
- Move-optimal partial gathering of mobile agents in asynchronous trees (Q1680543) (← links)
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
- Gathering of robots in a ring with mobile faults (Q1731510) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings (Q2182313) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- Asynchronous approach in the plane: a deterministic polynomial algorithm (Q2318113) (← links)
- Byzantine gathering in networks (Q2359766) (← links)
- (Q5002836) (← links)
- (Q5743418) (← links)
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks (Q6042397) (← links)