Graph exploration is one of the fundamental tasks performed by a mobile ...
The task of rendezvous (also called gathering) calls for a meeting of
tw...
A mobile agent, modeled as a deterministic finite automaton, navigates i...
The rendezvous task calls for two mobile agents, starting from different...
We consider the fundamental problems of size discovery and topology
reco...
A mobile agent navigating along edges of a simple connected graph, eithe...
Leader election is one of the fundamental problems in distributed comput...
Two mobile agents represented by points freely moving in the plane and
s...
A mobile agent equipped with a compass and a measure of length has to fi...
We consider leader election in anonymous radio networks modeled as simpl...
A team of mobile agents, starting from different nodes of an unknown net...
A robot modeled as a deterministic finite automaton has to build a struc...
A mobile agent has to find an inert treasure hidden in the plane. Both t...
Treasure hunt is the task of finding an inert target by a mobile agent i...
A team of anonymous mobile agents represented by points freely moving in...
Two anonymous mobile agents navigate synchronously in an anonymous graph...
We consider Parallel Random Access Machine (PRAM) which has some process...
We consider the task of rendezvous in networks modeled as undirected gra...
Broadcast is one of the fundamental network communication primitives. On...