scientific article; zbMATH DE number 7204593
From MaRDI portal
Publication:5111475
Recommendations
- Fast Computation by Population Protocols with a Leader
- Fast computation by population protocols with a leader
- The complexity of verifying population protocols
- The computational power of population protocols
- Polylogarithmic-time leader election in population protocols
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
- Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
- On the power of oracle \(\varOmega ?\) for self-stabilizing leader election in population protocols
- On the bit complexity of distributed computations in a ring with a leader
Cited in
(17)- Finding cut-offs in leaderless rendez-vous protocols is easy
- Running time analysis of broadcast consensus protocols
- Simple and fast approximate counting and leader election in populations
- A survey of size counting in population protocols
- Message complexity of population protocols
- Fast and succinct population protocols for Presburger arithmetic
- Constant-space population protocols for uniform bipartition
- Composable computation in discrete chemical reaction networks
- Fast Computation by Population Protocols with a Leader
- How many cooks spoil the soup?
- Distributed computation with continual population growth
- Computing with chemical reaction networks: a tutorial
- On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\)
- Distributed computation with continual population growth
- Fast computation by population protocols with a leader
- Data collection in population protocols with non-uniformly random scheduler
- Automatic analysis of expected termination time for population protocols
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 Q5111475)
