In this work, we consider a solution of automata similar to Population Protocols and Network
Constructors. The automata, also called nodes, move passively in a well-mixed solution and …

The context of this work is the well studied dissemination of information in large scale
distributed networks through pairwise interactions. This problem, originally called rumor …

Population protocols are a well established model of computation by anonymous, identical
finite state agents. A protocol is well-specified if from every initial configuration, all fair …

We investigate the problem of shape formation with robots on tiles in which a collection of
robots has to rearrange a set of movable tiles to form a desired shape. In this preliminary …

Flooding is among the simplest and most fundamental of all graph/network algorithms.
Consider a (distributed network in the form of a) finite undirected graph G with a …

Population protocols are a formal model of computation by identical, anonymous mobile
agents interacting in pairs. Their computational power is rather limited: Angluin et al. have …

Flooding is a fundamental distributed algorithms technique. Consider the following flooding
process, for simplicity, in a synchronous message passing network: A distinguished node …

Population protocols are required to converge to the correct answer, and are subject to a
fairness condition that guarantees eventual progress, but generally have no internal …

Abstract The Population Protocol model is a distributed model that concerns systems of very
weak computational entities that cannot control the way they interact. The model of Network …

We discuss recent theoretical models for programmable matter operating in a dynamic
environment. In the basic Network Constructors model, all devices are finite automata, begin …