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
Molecular Assembly and Computation: From Theory to Experimental Demonstrations
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
Theory and experiments in algorithmic self-assembly
Theory and experiments in algorithmic self-assembly
Complexities for generalized models of self-assembly
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
Complexity of Self-Assembled Shapes
SIAM Journal on Computing
Randomized Self-assembly for Approximate Shapes
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Strict self-assembly of discrete Sierpinski triangles
Theoretical Computer Science
Limitations of Self-assembly at Temperature One
DNA Computing and Molecular Programming
Self-assembly of the Discrete Sierpinski Carpet and Related Fractals
DNA Computing and Molecular Programming
Self-assembly of discrete self-similar fractals
Natural Computing: an international journal
Randomized Self-Assembly for Exact Shapes
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Approximate self-assembly of the Sierpinski triangle
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Limitations of self-assembly at temperature 1
Theoretical Computer Science
Computability and Complexity in Self-assembly
Theory of Computing Systems
Self-assembly of decidable sets
Natural Computing: an international journal
Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Complexity of compact proofreading for self-assembled patterns
DNA'05 Proceedings of the 11th international conference on DNA Computing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.23 |
We survey some recent results related to the self-assembly of infinite structures in Winfree's abstract Tile Assembly Model. These results include impossibility results, as well as the construction of novel tile assembly systems that produce computationally interesting shapes and patterns. Several open questions are also presented and motivated.