Randomized Self-Assembly for Exact Shapes

Authors:
David Doty
Affiliations:
-
Venue:
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Year:
2009

Citing 0
Cited 10

Self-assembly of infinite structures: A survey

Theoretical Computer Science
Limitations of self-assembly at temperature 1

Theoretical Computer Science
Optimizing tile concentrations to minimize errors and time for DNA tile self-assembly systems

DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Randomized self assembly of rectangular nano structures

DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Self-assembly of decidable sets

Natural Computing: an international journal
Randomized Self-Assembly for Exact Shapes

SIAM Journal on Computing
Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The power of nondeterminism in self-assembly

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models

Natural Computing: an international journal
Staging the self-assembly process: Inspiration from biological development

Artificial Life

Quantified Score

Hi-index	0.00

Visualization

Abstract

Working in Winfree's abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n x n square with high probability, for any sufficiently large n. This answers an open question of Kao and Schweller (Randomized Self-Assembly for Approximate Shapes, ICALP 2008), who showed how to build an *approximately* n x n square using tile concentration programming, and asked whether the approximation could be made *exact* with high probability.