We study private computations in a system of tiny mobile agents. We consider the mobile population protocol model of Angluin et al. [2] and ask what can be computed without ever re...
In the population protocol model introduced by Angluin et al. [2], a collection of agents, which are modelled by finite state machines, move around unpredictably and have pairwise ...
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 ag...
We consider the model of population protocols introduced by Angluin et al. [AAD+ 04], in which anonymous finite-state agents stably compute a predicate of the multiset of their in...
Dana Angluin, James Aspnes, David Eisenstat, Eric ...