Pages that link to "Item:Q2986885"
From MaRDI portal
The following pages link to Active self-assembly of algorithmic shapes and patterns in polylogarithmic time (Q2986885):
Displayed 36 items.
- An introduction to tile-based self-assembly and a survey of recent results (Q256961) (← links)
- Tight bounds for active self-assembly using an insertion primitive (Q513280) (← links)
- Connectivity preserving network transformers (Q529024) (← links)
- Terminating distributed construction of shapes and patterns in a fair solution of automata (Q1656881) (← links)
- A stochastic approach to shortcut bridging in programmable matter (Q1694423) (← links)
- On the transformation capability of feasible mechanisms for programmable matter (Q1741488) (← links)
- Fast arithmetic in algorithmic self-assembly (Q2003452) (← links)
- Parallel computation using active self-assembly (Q2003467) (← links)
- Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles (Q2003470) (← links)
- Shape formation by programmable particles (Q2174252) (← 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)
- On the Runtime of Universal Coating for Programmable Matter (Q2835712) (← links)
- Leader Election and Shape Formation with Self-organizing Programmable Matter (Q2948412) (← links)
- Network Constructors: A Model for Programmable Matter (Q2971122) (← links)
- Connectivity Preserving Network Transformers (Q4686658) (← links)
- Shape recognition by a finite automaton robot (Q5005154) (← links)
- Improved Leader Election for Self-organizing Programmable Matter (Q5056058) (← links)
- Parallel Computation Using Active Self-assembly (Q5168495) (← links)
- Iterative Self-assembly with Dynamic Strength Transformation and Temperature Control (Q5168506) (← 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)
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots (Q5918539) (← links)
- Distributed transformations of Hamiltonian shapes based on line moves (Q5918588) (← 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)
- A minimal requirement for self-assembly of lines in polylogarithmic time (Q6062023) (← links)
- (Q6079226) (← links)
- The canonical amoebot model: algorithms and concurrency control (Q6099032) (← links)
- On geometric shape construction via growth operations (Q6111993) (← links)
- Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes (Q6111997) (← links)
- The complexity of growing a graph (Q6112002) (← links)
- Building squares with optimal state complexity in restricted active self-assembly (Q6133652) (← links)
- On geometric shape construction via growth operations (Q6140359) (← links)
- Forming tile shapes with simple robots (Q6151177) (← links)