Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Distributed Computing manuscript No. (will be inserted by the editor)
 

Summary: Distributed Computing manuscript No.
(will be inserted by the editor)
Dana Angluin James Aspnes David Eisenstat
Fast Computation by Population Protocols With a Leader
Received: date / Accepted: date
Abstract 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 ad-
versary scheduler--where all pairs are equally likely to be
chosen for each interaction. It is shown that when a unique
leader agent is provided in the initial population, the popula-
tion can simulate a virtual register machine with high prob-
ability in which standard arithmetic operations like compar-
ison, addition, subtraction, and multiplication and division
by constants can be simulated in O(nlog5
n) interactions us-
ing a simple register representation or in O(nlog2
n) inter-
actions using a more sophisticated representation that re-

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collections: Computer Technologies and Information Sciences