Deterministic rendezvous in infinite trees
Authors:
- Subhash BhagatSBSubhash Bhagat
- Andrzej PelcAPAndrzej Pelc
- 22 November 2023
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 984
Abstract
No abstract availableKeywords
Funding Information
- Natural Sciences and Engineering Research Council of Canada
- Université du Québec en Outaouais
This publication has 17 references indexed in Scilit:
- Deterministic rendezvous in networks: A comprehensive surveyNetworks, 2012
- Distributed Computing by Mobile Robots: GatheringSIAM Journal on Computing, 2012
- How to meet when you forget: log-space rendezvous in arbitrary graphsDistributed Computing, 2011
- How to meet in anonymous networkTheoretical Computer Science, 2008
- Asynchronous deterministic rendezvous in graphsTheoretical Computer Science, 2006
- Gathering of asynchronous robots with limited visibilityTheoretical Computer Science, 2005
- Rendezvous search when marks are left at the starting pointsNaval Research Logistics (NRL), 2001
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability DistributionSIAM Journal on Control and Optimization, 1998
- Minimax Rendezvous on the LineSIAM Journal on Control and Optimization, 1996
- The Rendezvous Search ProblemSIAM Journal on Control and Optimization, 1995