4.2 Article

Fast and succinct population protocols for Presburger arithmetic

Related references

Note: Only part of the references are listed.
Article Computer Science, Theory & Methods

Time-space trade-offs in population protocols for the majority problem

Petra Berenbrink et al.

Summary: Population protocols are a model for distributed computing that emphasizes simplicity and robustness. Agents communicate in pairwise interactions to complete global tasks like choosing a leader or determining majority opinion. Protocols for the majority problem allow for a trade-off between the number of interactions and the number of states per agent.

DISTRIBUTED COMPUTING (2021)

Article Computer Science, Artificial Intelligence

Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks

Robert Brijder et al.

NATURAL COMPUTING (2018)

Article Computer Science, Artificial Intelligence

Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks

Robert Brijder et al.

NATURAL COMPUTING (2018)

Article Multidisciplinary Sciences

The Cell Cycle Switch Computes Approximate Majority

Luca Cardelli et al.

SCIENTIFIC REPORTS (2012)

Article Computer Science, Theory & Methods

Fast computation by population protocols with a leader

Dana Angluin et al.

DISTRIBUTED COMPUTING (2008)

Article Computer Science, Artificial Intelligence

Computation with finite stochastic chemical reaction networks

David Soloveichik et al.

Natural Computing (2008)

Article Computer Science, Theory & Methods

The computational power of population protocols

Dana Angluin et al.

DISTRIBUTED COMPUTING (2007)

Article Computer Science, Theory & Methods

Computation in networks of passively mobile finite-state sensors

D Angluin et al.

DISTRIBUTED COMPUTING (2006)