Pages that link to "Item:Q1954251"
From MaRDI portal
The following pages link to The computational power of population protocols (Q1954251):
Displayed 50 items.
- Solving the parity problem in one-dimensional cellular automata (Q272769) (← links)
- A simple population protocol for fast robust approximate majority (Q352239) (← 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)
- Verification of population protocols (Q523133) (← links)
- Connectivity preserving network transformers (Q529024) (← links)
- Mediated population protocols (Q533894) (← links)
- A self-stabilizing transformer for population protocols with covering (Q555304) (← 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)
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks (Q897391) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- Terminating distributed construction of shapes and patterns in a fair solution of automata (Q1656881) (← links)
- On the transformation capability of feasible mechanisms for programmable matter (Q1741488) (← links)
- Amorphous computing: a research agenda for the near future (Q1761710) (← links)
- Constructing self-stabilizing oscillators in population protocols (Q2013587) (← links)
- Time-space trade-offs in population protocols for the majority problem (Q2025852) (← links)
- The complexity of verifying population protocols (Q2025857) (← links)
- Clocked population protocols (Q2040025) (← links)
- Towards efficient verification of population protocols (Q2058386) (← 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)
- Distributed computation and reconfiguration in actively dynamic networks (Q2121068) (← links)
- Simple and fast approximate counting and leader election in populations (Q2139094) (← links)
- Reasoning in large games with unboundedly many players (Q2148813) (← links)
- Population protocols with unreliable communication (Q2148893) (← links)
- On convergence and threshold properties of discrete Lotka-Volterra population protocols (Q2168846) (← links)
- Pushing lines helps: efficient universal centralised transformations for programmable matter (Q2182711) (← links)
- Fault-tolerant simulation of population protocols (Q2220403) (← links)
- Robust biomolecular finite automata (Q2306018) (← links)
- Minimal output unstable configurations in chemical reaction networks and deciders (Q2311221) (← links)
- Noisy rumor spreading and plurality consensus (Q2318110) (← links)
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (Q2345463) (← links)
- Fast computation by population protocols with a leader (Q2377254) (← links)
- Advances in parameterized verification of population protocols (Q2399358) (← links)
- Computing in social networks (Q2637316) (← links)
- A combinatorial characterization of self-stabilizing population protocols (Q2672238) (← links)
- Population protocols: beyond runtime analysis (Q2695486) (← links)
- Protocols with constant local storage and unreliable communication (Q2699979) (← links)
- How Many Cooks Spoil the Soup? (Q2835012) (← links)
- Programming Discrete Distributions with Chemical Reaction Networks (Q2835702) (← links)
- Robustness of Expressivity in Chemical Reaction Networks (Q2835703) (← links)
- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications (Q2868641) (← links)
- Shortest, Fastest, and Foremost Broadcast in Dynamic Networks (Q2947805) (← links)
- Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) (Q2980175) (← links)
- Recent Advances in Population Protocols (Q3182913) (← links)