Pages that link to "Item:Q3586192"
From MaRDI portal
The following pages link to Programmable Control of Nucleation for Algorithmic Self-Assembly (Q3586192):
Displayed 10 items.
- Search methods for tile sets in patterned DNA self-assembly (Q395021) (← links)
- Complexity of graph self-assembly in accretive systems and self-destructible systems (Q633697) (← links)
- Capabilities and limits of compact error resilience methods for algorithmic self-assembly (Q848844) (← links)
- On the complexity of graph self-assembly in accretive systems (Q934978) (← links)
- Pictures worth a thousand tiles, a geometrical programming language for self-assembly (Q1013126) (← links)
- Tile complexity of approximate squares (Q1949754) (← links)
- Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems (Q3070959) (← links)
- Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems (Q3618692) (← links)
- A Self-assembly Model of Time-Dependent Glue Strength (Q3618693) (← links)
- Complexity of Compact Proofreading for Self-assembled Patterns (Q3618694) (← links)