Population protocols on graphs: a hierarchy
From MaRDI portal
Publication:5300908
Recommendations
Cited in
(9)- Large flocks of small birds: on the minimal size of population protocols
- All symmetric predicates in NSPACE\((n^{2})\) are stably computable by the mediated population protocol model
- Mediated population protocols
- The computational power of population protocols
- On the convergence of population protocols when population goes to infinity
- Mediated Population Protocols
- Homonym population protocols
- Brief Announcement: Fast Graphical Population Protocols
- Stably computable predicates are semilinear
This page was built for publication: Population protocols on graphs: a hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300908)