The Dynamics of Probabilistic Population Protocols
From MaRDI portal
Publication:3540255
Recommendations
Cites work
Cited in
(15)- The computational power of simple protocols for self-awareness on graphs
- scientific article; zbMATH DE number 7651155 (Why is no real title available?)
- Privacy in population protocols with probabilistic scheduling
- Mediated population protocols
- Recent Advances in Population Protocols
- The benefits of entropy in population protocols
- A totally distributed fair scheduler for population protocols by randomized handshakes
- Brief Announcement
- Fault-tolerant simulation of population protocols
- On the convergence of population protocols when population goes to infinity
- Computational models for networks of tiny artifacts: a survey
- Brief Announcement: Fast Graphical Population Protocols
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- The dynamics and stability of probabilistic population processes
- Passively mobile communicating machines that use restricted space
This page was built for publication: The Dynamics of Probabilistic Population Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540255)