The rendezvous problem on discrete locations
From MaRDI portal
DOI10.2307/3214827zbMATH Open0718.90047OpenAlexW2103469743WikidataQ56171917 ScholiaQ56171917MaRDI QIDQ5750705FDOQ5750705
Authors: Edward J. Anderson, Richard Weber 
Publication date: 1990
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/818e3d251c02c8ebd1b480a91c7fb989aa32422f
Recommendations
Cited In (47)
- Time versus space trade-offs for rendezvous in trees
- Rendezvous in planar environments with obstacles and unknown initial distance
- Strategy for quickest second meeting of two agents in two locations
- Deterministic polynomial approach in the plane
- Anonymous meeting in networks
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Fast rendezvous with advice
- On Romeo and Juliet problems: minimizing distance-to-sight
- A symbolic programming approach to the rendezvous search problem
- Almost universal anonymous rendezvous in the plane
- How to meet in anonymous network
- Use of information, memory and randomization in asynchronous gathering
- Gathering despite mischief
- Optimal symmetric rendezvous search on three locations
- Rendezvous problem
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
- Social distancing, gathering, search games: mobile agents on simple networks
- Price of asynchrony in mobile agents computing
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
- Rendezvous search on a star graph with examination costs
- Rendezvous numbers in normed spaces
- A Meeting Scheduling Problem Respecting Time and Space
- 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
- Rendezvous search on the line with bounded resources: Expected time minimization
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots
- Search-and-rescue rendezvous
- Rendezvous search with markers that can be dropped at chosen times
- Asynchronous deterministic rendezvous in graphs
- Rendez-vous search on a rectangular lattice
- Discrete Search for an Intelligent Object: The Leprechaun's Problem
- Rendezvous search on the edges of platonic solids: optimal waiting probabilities and multi-step strategies
- A common notion of clockwise can help in planar rendezvous
- Ten Open Problems in Rendezvous Search
- A further study on weak Byzantine gathering of mobile agents
- Many-player rendezvous search: Stick together or split and meet?
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
- Title not available (Why is that?)
- Rendezvous Search: A Personal Perspective
- Title not available (Why is that?)
- Asynchronous deterministic rendezvous in bounded terrains
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
- Deterministic rendezvous with different maps
- Rendezvous Search with Revealed Information: Applications to the Line
- Symmetric rendezvous with advice: how to rendezvous in a disk
- Title not available (Why is that?)
This page was built for publication: The rendezvous problem on discrete locations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5750705)
