The model of population protocols refers to the growing in popularity theoretical framework
suitable for studying pairwise interactions within a large collection of simple …

The model of population protocols refers to a large collection of simple indistinguishable
entities, frequently called\em agents. The agents communicate and perform computation …

The gathering (or multi-agent rendezvous) problem requires a set of mobile agents,
arbitrarily positioned at different nodes of a network to group within finite time at the same …

The model of population protocols refers to the growing in popularity theoretical framework
suitable for studying pairwise interactions within a large collection of simple …

Leader election is one of the fundamental problems in distributed computing. It calls for all
nodes of a network to agree on a single node, called the leader. If the nodes of the network …

In content-oblivious computation, n nodes wish to compute a given task over an
asynchronous network that suffers from an extremely harsh type of noise, which corrupts the …

We consider the problem of leader election among mobile agents operating in an arbitrary
network modeled as an undirected graph. Nodes of the network are unlabeled and all …

We investigate the computability of distributed tasks in reliable anonymous networks with
arbitrary knowledge. More precisely, we consider tasks computable with local termination …

We study (deterministic) leader election in unidirectional rings of homonym processes that
have no a priori knowledge on the number of processes. In this context, we show that there …

In content-oblivious computation, n nodes wish to compute a given task over an
asynchronous network that suffers from an extremely harsh type of noise, which corrupts the …