Pages that link to "Item:Q2377254"
From MaRDI portal
The following pages link to Fast computation by population protocols with a leader (Q2377254):
Displayed 50 items.
- Deterministic function computation with chemical reaction networks (Q268444) (← links)
- Tight complexity analysis of population protocols with cover times -- the ZebraNet example (Q391993) (← links)
- The computational power of simple protocols for self-awareness on graphs (Q392008) (← links)
- Computational models for networks of tiny artifacts: a survey (Q465666) (← links)
- Determining majority in networks with local interactions and very small local memory (Q518677) (← links)
- Verification of population protocols (Q523133) (← links)
- Mediated population protocols (Q533894) (← links)
- A self-stabilizing transformer for population protocols with covering (Q555304) (← links)
- Passively mobile communicating machines that use restricted space (Q650876) (← links)
- Computation with finite stochastic chemical reaction networks (Q1035715) (← links)
- Population protocols with faulty interactions: the impact of a leader (Q1628589) (← links)
- Terminating distributed construction of shapes and patterns in a fair solution of automata (Q1656881) (← links)
- Speed faults in computation by chemical reaction networks (Q1689751) (← links)
- On space complexity of self-stabilizing leader election in mediated population protocol (Q1938386) (← links)
- Leaderless deterministic chemical reaction networks (Q2003464) (← links)
- Constructing self-stabilizing oscillators in population protocols (Q2013587) (← links)
- Time-space trade-offs in population protocols for the majority problem (Q2025852) (← links)
- Clocked population protocols (Q2040025) (← links)
- Composable computation in discrete chemical reaction networks (Q2064055) (← links)
- How many cooks spoil the soup? (Q2075625) (← links)
- New bounds for the flock-of-birds problem (Q2097227) (← links)
- Distributed computation with continual population growth (Q2104041) (← links)
- Simple and fast approximate counting and leader election in populations (Q2139094) (← links)
- Fault-tolerant simulation of population protocols (Q2220403) (← links)
- Running time analysis of broadcast consensus protocols (Q2233402) (← links)
- A survey of size counting in population protocols (Q2243584) (← links)
- Loosely-stabilizing leader election with polylogarithmic convergence time (Q2285158) (← links)
- Advances in parameterized verification of population protocols (Q2399358) (← links)
- Population protocols: beyond runtime analysis (Q2695486) (← links)
- Robustness of Expressivity in Chemical Reaction Networks (Q2835703) (← links)
- Recent Advances in Population Protocols (Q3182913) (← links)
- Constant-Space Population Protocols for Uniform Bipartition (Q3300820) (← links)
- (Q3304110) (← links)
- On Gossip and Populations (Q3408161) (← links)
- Polylogarithmic-Time Leader Election in Population Protocols (Q3449497) (← links)
- Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator (Q3458203) (← links)
- On Space and Time Complexity of Loosely-Stabilizing Leader Election (Q3460723) (← links)
- Leader Election Requires Logarithmic Time in Population Protocols (Q5087070) (← links)
- A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States (Q5090899) (← links)
- (Q5091108) (← links)
- The Power of Global Knowledge on Self-stabilizing Population Protocols (Q5100963) (← links)
- Probabilistic Analysis of Rumor-Spreading Time (Q5139858) (← links)
- Constructing Self-stabilizing Oscillators in Population Protocols (Q5207913) (← links)
- (Q5874482) (← links)
- Stable leader election in population protocols requires linear time (Q5915694) (← links)
- (Q6079210) (← links)
- Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks (Q6084208) (← links)
- Lower bounds on the state complexity of population protocols (Q6096031) (← links)
- Fast and succinct population protocols for Presburger arithmetic (Q6142599) (← links)
- Computing with chemical reaction networks: a tutorial (Q6150974) (← links)