Message complexity of population protocols
From MaRDI portal
Publication:6535003
DOI10.4230/lipics.disc.2020.6zbMATH Open1543.68027MaRDI QIDQ6535003
Mahsa Eftekhari, Unnamed Author, James Aspnes, David Doty, Eric E. Severson
Publication date: 2 November 2023
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Distributed algorithms (68W15) Communication complexity, information complexity (68Q11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic function computation with chemical reaction networks
- A simple population protocol for fast robust approximate majority
- Passively mobile communicating machines that use restricted space
- Computation with finite stochastic chemical reaction networks
- Brief announcement: fast approximate counting and leader election in populations
- Leaderless deterministic chemical reaction networks
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Fast and Exact Majority in Population Protocols
- Efficient Turing-Universal Computation with DNA Polymers
- Polylogarithmic-Time Leader Election in Population Protocols
- Time-Space Trade-offs in Population Protocols
- Optimal time and space leader election in population protocols
- Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols
- On Counting the Population Size
- Logarithmic Expected-Time Leader Election in Population Protocol Model
- Stably computable predicates are semilinear
- Brief Announcement
- Simple and Efficient Leader Election
- Brief Announcement
- Timing in chemical reaction networks
- Stable leader election in population protocols requires linear time
Related Items (1)
This page was built for publication: Message complexity of population protocols
