Mobile Agent Rendezvous in a Synchronous Torus

Kranakis, E; Krizanc, D; Markou, E

dc.contributor.author	Kranakis, E	en
dc.contributor.author	Krizanc, D	en
dc.contributor.author	Markou, E	en
dc.date.accessioned	2014-03-01T02:50:16Z
dc.date.available	2014-03-01T02:50:16Z
dc.date.issued	2006	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35006
dc.subject	Mobile Agent	en
dc.subject	Sense of Direction	en
dc.title	Mobile Agent Rendezvous in a Synchronous Torus	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/11682462_60	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11682462_60	en
heal.publicationDate	2006	en
heal.abstract	We consider the rendezvous problem for identical mobile agents (i.e., running the same deterministic algorithm) with tokens in a synchronous torus with a sense of direction and show that there is a striking computational dierence between one and more tokens. More specifically, we show that 1) two agents with a constant number of unmovable tokens, or with one movable token,	en
heal.journalName	Latin American Theoretical INformatics	en
dc.identifier.doi	10.1007/11682462_60	en