The following pages link to Mediated population protocols (Q533894):
Displaying 38 items.
- Traveling salesman problems in temporal graphs (Q284573) (← 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)
- Connectivity preserving network transformers (Q529024) (← links)
- Passively mobile communicating machines that use restricted space (Q650876) (← 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)
- 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)
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication (Q1689748) (← links)
- Temporal network optimization subject to connectivity constraints (Q1739101) (← links)
- On space complexity of self-stabilizing leader election in mediated population protocol (Q1938386) (← links)
- The complexity of verifying population protocols (Q2025857) (← links)
- Clocked population protocols (Q2040025) (← links)
- Towards efficient verification of population protocols (Q2058386) (← links)
- How many cooks spoil the soup? (Q2075625) (← links)
- Distributed computation and reconfiguration in actively dynamic networks (Q2121068) (← links)
- Simple and fast approximate counting and leader election in populations (Q2139094) (← links)
- Population protocols with unreliable communication (Q2148893) (← 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)
- The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
- Protocols with constant local storage and unreliable communication (Q2699979) (← links)
- How Many Cooks Spoil the Soup? (Q2835012) (← links)
- Network Constructors: A Model for Programmable Matter (Q2971122) (← links)
- Mediated Population Protocols: Leader Election and Applications (Q2988820) (← links)
- (Q3304110) (← links)
- (Q3385654) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
- Connectivity Preserving Network Transformers (Q4686658) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- (Q5090892) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438) (← links)
- Simple and efficient local codes for distributed stable network construction (Q5892129) (← links)
- Fault tolerant network constructors (Q6044462) (← links)
- Fault tolerant network constructors (Q6536337) (← links)
