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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Distributed computing Jg. 21; H. 3; S. 183 - 199
Hauptverfasser:	Angluin, Dana, Aspnes, James, Eisenstat, David
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer-Verlag 01.09.2008 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!