A Limit to the Power of Multiple Nucleation in Self-assembly

DOI10.1007/978-3-540-87779-0_31zbMath1161.68472OpenAlexW1488471656MaRDI QIDQ3540250

Aaron Sterling

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87779-0_31

zbMATH Keywords

self-assemblylocally checkable labelingmultiple nucleation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

Distributed agreement in tile self-assembly

Cites Work

• Unnamed Item
• Self-assembly of discrete self-similar fractals
• The program-size complexity of self-assembled squares (extended abstract)
• Computability and Complexity in Self-assembly
• What Can be Computed Locally?
• Running time and program size for self-assembled squares
• Strict Self-assembly of Discrete Sierpinski Triangles
• Complexity of Self‐Assembled Shapes

This page was built for publication: A Limit to the Power of Multiple Nucleation in Self-assembly