Self-assembly of discrete self-similar fractals
From MaRDI portal
Publication:968403
DOI10.1007/s11047-009-9147-7zbMath1204.28016arXiv0803.1672MaRDI QIDQ968403
Matthew J. Patitz, Scott M. Summers
Publication date: 5 May 2010
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.1672
Related Items
Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals, Hierarchical self-assembly of fractals with signal-passing tiles, The need for seed (in the abstract Tile Assembly Model), An introduction to tile-based self-assembly and a survey of recent results, Strict self-assembly of fractals using multiple hands, Self-assembling rulers for approximating generalized Sierpinski carpets, Self-assembly of infinite structures: a survey, Approximate self-assembly of the Sierpinski triangle, Fractal dimension of assemblies in the abstract tile assembly model, On the effects of hierarchical self-assembly for reducing program-size complexity, Scaled pier fractals do not strictly self-assemble, Self-assembly of 4-sided fractals in the two-handed tile assembly model, Hierarchical Self-Assembly of Fractals with Signal-Passing Tiles, Scaled Tree Fractals Do not Strictly Self-assemble, Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles, A Limit to the Power of Multiple Nucleation in Self-assembly
Cites Work
- Unnamed Item
- Strict self-assembly of discrete Sierpinski triangles
- The program-size complexity of self-assembled squares (extended abstract)
- Combinatorial optimization problems in self-assembly
- Reducing tile complexity for self-assembly through temperature programming
- Self-assembly of the Discrete Sierpinski Carpet and Related Fractals
- Complexity of Self‐Assembled Shapes
- Mathematical Foundations of Computer Science 2005
