Pages that link to "Item:Q1938363"
From MaRDI portal
The following pages link to How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363):
Displayed 32 items.
- Anonymous meeting in networks (Q262278) (← links)
- Synchronous robots vs asynchronous lights-enhanced robots on graphs (Q737100) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q831752) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Rendezvous of heterogeneous mobile agents in edge-weighted networks (Q896142) (← links)
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← 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)
- Use of information, memory and randomization in asynchronous gathering (Q1745729) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- Asynchronous approach in the plane: a deterministic polynomial algorithm (Q2318113) (← links)
- Deterministic rendezvous with different maps (Q2323344) (← links)
- Distinguishing views in symmetric networks: a tight lower bound (Q2342668) (← links)
- Deterministic polynomial approach in the plane (Q2353250) (← links)
- Byzantine gathering in networks (Q2359766) (← links)
- Rendezvous in networks in spite of delay faults (Q2629214) (← links)
- Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? (Q2835014) (← links)
- Deterministic Meeting of Sniffing Agents in the Plane (Q2835027) (← links)
- Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty (Q2961404) (← links)
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126) (← links)
- Byzantine Gathering in Networks with Authenticated Whiteboards (Q2980903) (← links)
- (Q5002836) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- Deterministic Rendezvous with Detection Using Beeps (Q5890529) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q5964898) (← links)
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks (Q6042397) (← links)
- Almost universal anonymous rendezvous in the plane (Q6046947) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q6094723) (← links)
- Deterministic rendezvous in infinite trees (Q6140349) (← links)
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs (Q6195335) (← links)