An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Running time and program size for self-assembled squares
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Combinatorial optimization problems in self-assembly
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
Complexities for Generalized Models of Self-Assembly
SIAM Journal on Computing
Reducing tile complexity for self-assembly through temperature programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A microfluidic device for DNA tile self-assembly
DNA'05 Proceedings of the 11th international conference on DNA Computing
Complexity of self-assembled shapes
DNA'04 Proceedings of the 10th international conference on DNA computing
Random Number Selection in Self-assembly
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Step-Assembly with a Constant Number of Tile Types
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Shape replication through self-assembly and RNase enzymes
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Self-assembly of decidable sets
Natural Computing: an international journal
One-dimensional staged self-assembly
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Randomized Self-Assembly for Exact Shapes
SIAM Journal on Computing
Parallelism and time in hierarchical self-assembly
Proceedings of the twenty-third 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
Natural Computing: an international journal
Self-assembly with geometric tiles
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Theory of algorithmic self-assembly
Communications of the ACM
Step-wise tile assembly with a constant number of tile types
Natural Computing: an international journal
An introduction to tile-based self-assembly
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
One-dimensional staged self-assembly
Natural Computing: an international journal
The two-handed tile assembly model is not intrinsically universal
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.02 |
We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model and its various constraints and performance measures are motivated by a practical nanofabrication scenario through protein-based bioengineering. Staging allows us to break through the traditional lower bounds in tile self-assembly by encoding the shape in the staging algorithm instead of the tiles. All of our results are based on the practical assumption that only a constant number of glues, and thus only a constant number of tiles, can be engineered. Under this assumption, traditional tile self-assembly cannot even manufacture an n 脳 n square; in contrast, we show how staged assembly in theory enables manufacture of arbitrary shapes in a variety of precise formulations of the model.