scientific article; zbMATH DE number 5605125
From MaRDI portal
Publication:3396623
Cited in
(41)- On the convergence of population protocols when population goes to infinity
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- On space complexity of self-stabilizing leader election in mediated population protocol
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Time-space trade-offs in population protocols for the majority problem
- How many cooks spoil the soup?
- On parallel time in population protocols
- New bounds for the flock-of-birds problem
- Distributed computation and reconfiguration in actively dynamic networks
- Simple and fast approximate counting and leader election in populations
- Fault-tolerant simulation of population protocols
- Running time analysis of broadcast consensus protocols
- Minimal output unstable configurations in chemical reaction networks and deciders
- Probability 1 computation with chemical reaction networks
- Noisy rumor spreading and plurality consensus
- Deterministic function computation with chemical reaction networks
- Amorphous computing: examples, mathematics and theory
- How Many Cooks Spoil the Soup?
- Recent Advances in Population Protocols
- On gossip and populations
- Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- A simple population protocol for fast robust approximate majority
- The computational power of simple protocols for self-awareness on graphs
- Computational models for networks of tiny artifacts: a survey
- Connectivity preserving network transformers
- Limits for rumor spreading in stochastic populations
- A Survey on Analog Models of Computation
- scientific article; zbMATH DE number 7561256 (Why is no real title available?)
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Mediated population protocols
- scientific article; zbMATH DE number 7651155 (Why is no real title available?)
- Computing with chemical reaction networks: a tutorial
- Passively mobile communicating machines that use restricted space
- On the power of synchronization between two adjacent processes
- Early adapting to trends: self-stabilizing information spread using passive communication
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
- Rate-independent computation in continuous chemical reaction networks
- Homonym population protocols
- Space-efficient self-stabilizing counting population protocols on mobile sensor networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396623)
