The following pages link to (Q4992866):
Displayed 14 items.
- The two-handed tile assembly model is not intrinsically universal (Q262271) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Universal coating for programmable matter (Q529029) (← links)
- Optimal staged self-assembly of general shapes (Q1751102) (← links)
- Nearly constant tile complexity for any shape in two-handed tile assembly (Q1999963) (← links)
- Parallel computation using active self-assembly (Q2003467) (← links)
- Robust biomolecular finite automata (Q2306018) (← links)
- The Complexity of Fixed-Height Patterned Tile Self-assembly (Q2830225) (← links)
- The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems (Q2945884) (← links)
- Leader Election and Shape Formation with Self-organizing Programmable Matter (Q2948412) (← links)
- Improved Leader Election for Self-organizing Programmable Matter (Q5056058) (← links)
- Self-Attraction Removal from Oritatami Systems (Q5205042) (← links)
- Particle-based assembly using precise global control (Q5896892) (← links)
- Complexity of verification in self-assembly with prebuilt assemblies (Q6156158) (← links)