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
Elements of the Theory of Computation
Elements of the Theory of Computation
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
Complexity of Self-Assembled Shapes
SIAM Journal on Computing
Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues
Natural Computing: an international journal
Randomized Self-assembly for Approximate Shapes
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
The Tile Complexity of Linear Assemblies
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Polyomino-Safe DNA Self-assembly via Block Replacement
DNA Computing
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
Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Randomized Self-Assembly for Exact Shapes
SIAM Journal on Computing
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
The power of nondeterminism in self-assembly
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Theory of algorithmic self-assembly
Communications of the ACM
An introduction to tile-based self-assembly
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
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 study the role that parallelism plays in time complexity of variants of Winfree's abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the "hierarchical" aTAM, two assemblies, both consisting of multiple tiles, are allowed to aggregate together, whereas in the "seeded" aTAM, tiles attach one at a time to a growing assembly. Adleman, Cheng, Goel, and Huang (Running Time and Program Size for Self-Assembled Squares, STOC 2001) showed how to assemble an n x n square in O(n) time in the seeded aTAM using O(log n/log log n) unique tile types, where both of these parameters are optimal. They asked whether the hierarchical aTAM could allow a tile system to use the ability to form large assemblies in parallel before they attach to break the Ω(n) lower bound for assembly time. We show that there is a tile system with the optimal O(log n/log log n) tile types that assembles an n x n square using O(log2 n) parallel "stages", which is close to the optimal Ω(log n) stages, forming the final n x n square from four n/2 x n/2 squares, which are themselves recursively formed from n/4 x n/4 squares, etc. However, despite this nearly maximal parallelism, the system requires superlinear time to assemble the square. We extend the definition of partial order tile systems studied by Adleman et al. in a natural way to hierarchical assembly and show that no hierarchical partial order tile system can build any shape with diameter N in less than time Ω(N), demonstrating that in this case the hierarchical model affords no speedup whatsoever over the seeded model. We also strengthen the Ω(N) time lower bound for deterministic seeded systems of Adleman et al. to nondeterministic seeded systems. Finally, we show that for infinitely many n, a tile system can assemble an n x n' rectangle, with n n', in time O(n4/5 log n), breaking the linear-time lower bound that applies to all seeded systems and partial order hierarchical systems.