Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Stably Computable Predicates are Semilinear Dana Angluin
 

Summary: Stably Computable Predicates are Semilinear
Dana Angluin
Department of Computer
Science, Yale University
angluin@cs.yale.edu
James Aspnes

Department of Computer
Science, Yale University
aspnes@cs.yale.edu
David Eisenstat
Department of Computer
Science, University of
Rochester
eisen@cs.rochester.edu
ABSTRACT
We consider the model of population protocols intro-
duced by Angluin et al. [2], in which anonymous finite-state
agents stably compute a predicate of their inputs via two-
way interactions in the all-pairs family of communication

  

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

 

Collections: Computer Technologies and Information Sciences