Pages that link to "Item:Q650876"

The following pages link to Passively mobile communicating machines that use restricted space (Q650876):

Displaying 22 items.

• The computational power of simple protocols for self-awareness on graphs (Q392008) (← links)
• Computational models for networks of tiny artifacts: a survey (Q465666) (← links)
• Connectivity preserving network transformers (Q529024) (← links)
• Mediated population protocols (Q533894) (← links)
• Passively mobile communicating machines that use restricted space (Q650876) (← links)
• Homonym population protocols (Q722223) (← 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)
• The complexity of verifying population protocols (Q2025857) (← links)
• Clocked population protocols (Q2040025) (← links)
• How many cooks spoil the soup? (Q2075625) (← 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)
• A survey of size counting in population protocols (Q2243584) (← links)
• How Many Cooks Spoil the Soup? (Q2835012) (← links)
• A Glimpse at Paul G. Spirakis (Q3464465) (← links)
• Connectivity Preserving Network Transformers (Q4686658) (← links)
• A Survey on Analog Models of Computation (Q5024572) (← links)
• Simple and efficient local codes for distributed stable network construction (Q5892129) (← links)
• Message complexity of population protocols (Q6535003) (← links)