Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
From MaRDI portal
Publication:2934643
Recommendations
Cited in
(20)- Time versus space trade-offs for rendezvous in trees
- Deterministic polynomial approach in the plane
- Fast rendezvous with advice
- How to meet in anonymous network
- Use of information, memory and randomization in asynchronous gathering
- Rendezvous problem
- Gathering despite mischief
- Deterministic network exploration by a single agent with Byzantine tokens
- Price of asynchrony in mobile agents computing
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Rendezvous in networks in spite of delay faults
- scientific article; zbMATH DE number 7561402 (Why is no real title available?)
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- Leader election for anonymous asynchronous agents in arbitrary networks
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs
- Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- Synchronous rendezvous for location-aware agents
- Asynchronous deterministic rendezvous in bounded terrains
- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
This page was built for publication: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934643)
