Population protocols are used as a theoretical model for a collection (or population) of tiny
mobile agents that interact with one another to carry out a computation. The agents are …

We explore the computational power of networks of small resource-limited mobile agents.
We define two new models of computation based on pairwise interactions of finite-state …

We consider the model of population protocols introduced by Angluin et al.(Computation in
networks of passively mobile finite-state sensors, pp. 290–299. ACM, New York, 2004), in …

The production of J/Ψ mesons in central collisions of heavy nuclei is investigated as a
function of collision energy. Two contributions are considered simultaneously: early (hard) …

Fast algorithms are presented for performing computations in a probabilistic population
model. This is a variant of the standard population protocol model, in which finite-state …

We consider the model of population protocols introduced by Angluin et al.[2], in which
anonymous finite-state agents stably compute a predicate of their inputs via two-way …

This article studies self-stabilization in networks of anonymous, asynchronously interacting
nodes where the size of the network is unknown. Constant-space protocols are given for …

This paper considers the self-stabilizing leader-election problem in a model of interacting
anonymous finite-state agents. Leader election is a fundamental problem in distributed …

A new model that depicts a network of randomized finite state machines operating in an
asynchronous environment is introduced. This model, that can be viewed as a hybrid of the …

A Survey on Analog Models of Computation Page 1 Chapter 6 A Survey on Analog Models of
Computation Olivier Bournez and Amaury Pouly Abstract We present a survey on analog …