Randomized Self Assembly of Rectangular Nano Structures
From MaRDI portal
Publication:3070965
Recommendations
- Efficient algorithms for self assembling non-rectangular nano structures
- Randomized self-assembly for exact shapes
- Randomized Self-Assembly for Exact Shapes
- Randomized Self-assembly for Approximate Shapes
- On stability of self-assembled nanoscale patterns
- Describing Self-assembly of Nanostructures
- Nanoscale spontaneous patterning
- Fast algorithmic self-assembly of simple shapes using random agitation
Cites work
- Complexities for Generalized Models of Self-Assembly
- Randomized Self-Assembly for Exact Shapes
- Randomized Self-assembly for Approximate Shapes
- Reducing tile complexity for self-assembly through temperature programming
- Running time and program size for self-assembled squares
- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
- The program-size complexity of self-assembled squares (extended abstract)
Cited in
(6)- Efficient algorithms for self assembling non-rectangular nano structures
- Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models
- Randomized self-assembly for exact shapes
- On stability of self-assembled nanoscale patterns
- Self-assembling micrites based on the Platonic solids
- Randomized Self-assembly for Approximate Shapes
This page was built for publication: Randomized Self Assembly of Rectangular Nano Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070965)