Fast computation by population protocols with a leader

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 agents interact in pairs under the control of an adversary scheduler, where all pairs are equally likely to be chosen for...

Full description

Bibliographic Details

Published in:	Distributed computing Vol. 21; no. 3; pp. 183 - 199
Main Authors:	Angluin, Dana, Aspnes, James, Eisenstat, David
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer-Verlag 01.09.2008 Springer Nature B.V
Subjects:	Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Software Engineering/Programming and Operating Systems Theory of Computation Parallel Time Infected Node Turing Machine Leader Election Phase Clock
ISSN:	0178-2770, 1432-0452
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!