Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
From MaRDI portal
(Redirected from Publication:4210191)
Recommendations
Cited in
(29)- Time versus space trade-offs for rendezvous in trees
- Rendezvous in planar environments with obstacles and unknown initial distance
- Fast rendezvous with advice
- Deterministic rendezvous in infinite trees
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Games of crowding
- A symbolic programming approach to the rendezvous search problem
- Use of information, memory and randomization in asynchronous gathering
- Gathering despite mischief
- Line-of-sight rendezvous
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Rendezvous in networks in spite of delay faults
- Asynchronous Deterministic Rendezvous on the Line
- Search-and-rescue rendezvous
- Rendezvous search with markers that can be dropped at chosen times
- Asynchronous deterministic rendezvous in graphs
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- A common notion of clockwise can help in planar rendezvous
- Fast deterministic rendezvous in labeled lines
- A further study on weak Byzantine gathering of mobile agents
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- Synchronous rendezvous for location-aware agents
- Deterministic rendezvous with different maps
- Want to gather? No need to chatter!
- Rendezvous search on a sphere: the astronaut problem
- Rendezvous search when marks are left at the starting points
- Rendezvous search on labeled networks
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
This page was built for publication: Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210191)
