On Times to Compute Shapes in 2D Tile Self-assembly

DOI10.1007/11925903_16zbMATH Open1132.68388OpenAlexW1569962195MaRDI QIDQ5452576FDOQ5452576

Authors: Boonsit Yimwadsana, Yuliy M. Baryshnikov, E. G. jun. Coffman 

Publication date: 4 April 2008

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11925903_16

Recommendations

• An introduction to tile-based self-assembly
• Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
• Randomized self-assembly for exact shapes
• Complexity of Self‐Assembled Shapes
• A Self-assembly Model of Time-Dependent Glue Strength

Mathematics Subject Classification ID

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

Cited In (8)

• Self-correcting Self-assembly: Growth Models and the Hammersley Process
• Tile automaton in the well-mixed medium
• Complexity classes for self-assembling flexible tiles
• Nearly constant tile complexity for any shape in two-handed tile assembly
• DNA Computing
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• A Self-assembly Model of Time-Dependent Glue Strength
• Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D

This page was built for publication: On Times to Compute Shapes in 2D Tile Self-assembly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452576)