Active Self-Assembly of Simple Units Using an Insertion Primitive
From MaRDI portal
Recommendations
- Non-determinism reduces construction time in active self-assembly using an insertion primitive
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Fast algorithmic self-assembly of simple shapes using random agitation
- Building squares with optimal state complexity in restricted active self-assembly
- Simulation of programmable matter systems using active tile-based self-assembly
- Modeling through self-assembly
- Computational self-assembly
- ACTIVE TILE SELF-ASSEMBLY, PART 2: SELF-SIMILAR STRUCTURES AND STRUCTURAL RECURSION
Cited in
(11)- Path finding in the tile assembly model
- A minimal requirement for self-assembly of lines in polylogarithmic time
- Non-determinism reduces construction time in active self-assembly using an insertion primitive
- Parallel computation using active self-assembly
- An exponentially growing nubot system without state changes
- Exploring programmable self-assembly in non-DNA based molecular computing
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Automated self-assembly programming paradigm: The impact of network topology
- A minimal requirement for self-assembly of lines in polylogarithmic time
- Implementing Non-Equilibrium Networks with Active Circuits of Duplex Catalysts.
- Turning machines
This page was built for publication: Active Self-Assembly of Simple Units Using an Insertion Primitive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741819)
