The following pages link to (Q3396623):
Displaying 42 items.
- Deterministic function computation with chemical reaction networks (Q268444) (← links)
- Amorphous computing: examples, mathematics and theory (Q272778) (← links)
- A simple population protocol for fast robust approximate majority (Q352239) (← 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)
- Mediated population protocols (Q533894) (← links)
- Passively mobile communicating machines that use restricted space (Q650876) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model (Q692907) (← links)
- Homonym population protocols (Q722223) (← links)
- Space-efficient self-stabilizing counting population protocols on mobile sensor networks (Q740980) (← links)
- On the convergence of population protocols when population goes to infinity (Q1036527) (← links)
- Population protocols with faulty interactions: the impact of a leader (Q1628589) (← links)
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication (Q1689748) (← links)
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony (Q1938370) (← links)
- On space complexity of self-stabilizing leader election in mediated population protocol (Q1938386) (← links)
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits (Q2002052) (← links)
- Time-space trade-offs in population protocols for the majority problem (Q2025852) (← links)
- How many cooks spoil the soup? (Q2075625) (← links)
- On parallel time in population protocols (Q2094385) (← links)
- New bounds for the flock-of-birds problem (Q2097227) (← links)
- Distributed computation and reconfiguration in actively dynamic networks (Q2121068) (← 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)
- Dynamic networks of finite state machines (Q2292917) (← links)
- Minimal output unstable configurations in chemical reaction networks and deciders (Q2311221) (← links)
- Probability 1 computation with chemical reaction networks (Q2311222) (← links)
- Noisy rumor spreading and plurality consensus (Q2318110) (← links)
- How Many Cooks Spoil the Soup? (Q2835012) (← links)
- Recent Advances in Population Protocols (Q3182913) (← links)
- On Gossip and Populations (Q3408161) (← links)
- Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents (Q3408164) (← links)
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Q3448801) (← links)
- Connectivity Preserving Network Transformers (Q4686658) (← links)
- (Q4993318) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- (Q5090892) (← links)
- A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States (Q5090899) (← links)
- (Q5874482) (← links)
- Computing with chemical reaction networks: a tutorial (Q6150974) (← links)
- Early adapting to trends: self-stabilizing information spread using passive communication (Q6658819) (← links)
