Rendezvous of Mobile Agents without Agreement on Local Orientation
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 515-526
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- How to meet asynchronously (almost) everywhere2010
- Election and rendezvous with incomparable labelsTheoretical Computer Science, 2008
- Deterministic Rendezvous in Trees with Little Memory2008
- Map construction of unknown graphs by multiple agentsTheoretical Computer Science, 2007
- About the Termination Detection in the Asynchronous Message Passing ModelLecture Notes in Computer Science, 2007
- Effective Elections for Anonymous Mobile Agents2006
- Mobile Agent Algorithms Versus Message Passing AlgorithmsLecture Notes in Computer Science, 2006
- Can we elect if we cannot compare?2003
- Fibrations of graphsDiscrete Mathematics, 2002
- Rendezvous search when marks are left at the starting pointsNaval Research Logistics (NRL), 2001