Pages that link to "Item:Q2375293"

The following pages link to Computation in networks of passively mobile finite-state sensors (Q2375293):

Displaying 50 items.

• Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
• Deterministic function computation with chemical reaction networks (Q268444) (← links)
• Traveling salesman problems in temporal graphs (Q284573) (← links)
• A simple population protocol for fast robust approximate majority (Q352239) (← links)
• Anonymous asynchronous systems: the case of failure detectors (Q360279) (← 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)
• Loosely-stabilizing leader election in a population protocol model (Q442276) (← links)
• Computational models for networks of tiny artifacts: a survey (Q465666) (← links)
• Position discovery for a system of bouncing robots (Q498402) (← links)
• Localization for a system of colliding robots (Q498669) (← links)
• Determining majority in networks with local interactions and very small local memory (Q518677) (← links)
• Verification of population protocols (Q523133) (← links)
• Connectivity preserving network transformers (Q529024) (← links)
• Universal coating for programmable matter (Q529029) (← links)
• Mediated population protocols (Q533894) (← links)
• Strand algebras for DNA computing (Q537852) (← links)
• A self-stabilizing transformer for population protocols with covering (Q555304) (← 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)
• Space-efficient self-stabilizing counting population protocols on mobile sensor networks (Q740980) (← links)
• Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots (Q820545) (← links)
• How many ants does it take to find the food? (Q896147) (← 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)
• Speed faults in computation by chemical reaction networks (Q1689751) (← links)
• A stochastic approach to shortcut bridging in programmable matter (Q1694423) (← links)
• Temporal network optimization subject to connectivity constraints (Q1739101) (← links)
• On the transformation capability of feasible mechanisms for programmable matter (Q1741488) (← links)
• On space complexity of self-stabilizing leader election in mediated population protocol (Q1938386) (← links)
• Anonymous and fault-tolerant shared-memory computing (Q1954238) (← links)
• The computational power of population protocols (Q1954251) (← links)
• Theory of reaction automata: a survey (Q1983008) (← links)
• Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits (Q2002052) (← 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)
• 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)
• 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)
• Search by a metamorphic robotic system in a finite 2D square grid (Q2139088) (← links)
• Simple and fast approximate counting and leader election in populations (Q2139094) (← links)