Self-assembly of infinite structures: a survey
DOI10.1016/J.TCS.2010.08.015zbMATH Open1232.05050OpenAlexW2027696551MaRDI QIDQ616502FDOQ616502
Authors: Matthew J. Patitz, Scott M. Summers 
Publication date: 10 January 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.08.015
Recommendations
- scientific article; zbMATH DE number 7298599
- An introduction to tile-based self-assembly and a survey of recent results
- Intrinsic universality and the computational power of self-assembly
- The undecidability of the infinite ribbon problem: implications for computing by self-assembly
- Self-assembly of Discrete Self-similar Fractals
complexitytile assembly modelundecidabilitycomputabilityTuring machinestile self-assemblydiscrete self-similar fractalstile assembly systemtile assemby model (TAM)
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of tessellation and tiling problems (05B45)
Cites Work
- Strict self-assembly of discrete Sierpinski triangles
- The program-size complexity of self-assembled squares (extended abstract)
- Randomized Self-assembly for Approximate Shapes
- Combinatorial optimization problems in self-assembly
- Complexity of Compact Proofreading for Self-assembled Patterns
- Running time and program size for self-assembled squares
- Complexities for Generalized Models of Self-Assembly
- The power of nondeterminism in self-assembly
- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
- Complexity of Self‐Assembled Shapes
- Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications
- Complexities for generalized models of self-assembly
- Title not available (Why is that?)
- DNA Computing
- Limitations of self-assembly at temperature 1
- Self-assembly of discrete self-similar fractals
- Self-assembly of the discrete Sierpinski carpet and related fractals
- Reducing tile complexity for self-assembly through temperature programming
- DNA Computing
- Computability and Complexity in Self-assembly
- Self-assembly of Decidable Sets
- Title not available (Why is that?)
- Randomized Self-Assembly for Exact Shapes
- Limitations of Self-assembly at Temperature One
- Design and Simulation of Self-repairing DNA Lattices
- Mathematical Foundations of Computer Science 2005
Cited In (14)
- An introduction to tile-based self-assembly and a survey of recent results
- Self-assembly of 3-D structures using 2-D folding tiles
- The undecidability of the infinite ribbon problem: implications for computing by self-assembly
- Title not available (Why is that?)
- Fractal dimension of assemblies in the abstract tile assembly model
- Plane-filling properties of directed figures
- Transformations and Preservation of Self-assembly Dynamics through Homotheties
- Ideas about self assembly
- Hypergraph automata: a theoretical model for patterned self-assembly
- Hypergraph automata: a theoretical model for patterned self-assembly
- A Limit to the Power of Multiple Nucleation in Self-assembly
- A combinatorial approach to the problem of self-assembly
- A brief tour of theoretical tile self-assembly
- TCS special issue on computational self-assembly
This page was built for publication: Self-assembly of infinite structures: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616502)
