Pages that link to "Item:Q5892129"
From MaRDI portal
The following pages link to Simple and efficient local codes for distributed stable network construction (Q5892129):
Displaying 32 items.
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- Connectivity preserving network transformers (Q529024) (← links)
- Universal coating for programmable matter (Q529029) (← 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)
- 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)
- Pushing lines helps: efficient universal centralised transformations for programmable matter (Q2182711) (← links)
- CADbots: algorithmic aspects of manipulating programmable matter with finite automata (Q2223704) (← links)
- How Many Cooks Spoil the Soup? (Q2835012) (← links)
- On the Runtime of Universal Coating for Programmable Matter (Q2835712) (← links)
- Network Constructors: A Model for Programmable Matter (Q2971122) (← links)
- Information Spreading by Mobile Particles on a Line (Q3460722) (← 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)
- Shape recognition by a finite automaton robot (Q5005154) (← 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)
- On efficient connectivity-preserving transformations in a grid (Q5918321) (← links)
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach (Q5918536) (← links)
- Distributed transformations of Hamiltonian shapes based on line moves (Q5918588) (← links)
- Threshold-based network structural dynamics (Q5918636) (← links)
- Distributed transformations of Hamiltonian shapes based on line moves (Q5918708) (← links)
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach (Q5918710) (← links)
- (Q5925155) (redirect page) (← links)
- Threshold-based network structural dynamics (Q5925585) (← links)
- Fault tolerant network constructors (Q6044462) (← links)
- The canonical amoebot model: algorithms and concurrency control (Q6099032) (← links)
- On geometric shape construction via growth operations (Q6140359) (← links)
- Forming tile shapes with simple robots (Q6151177) (← links)
