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
On the Decidability of Self-Assembly of Infinite Ribbons
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
Self-correcting self-assembly: growth models and the hammersley process
DNA'05 Proceedings of the 11th international conference on DNA Computing
DNA'04 Proceedings of the 10th international conference on DNA computing
Error free self-assembly using error prone tiles
DNA'04 Proceedings of the 10th international conference on DNA computing
Compact error-resilient computational DNA tiling assemblies
DNA'04 Proceedings of the 10th international conference on DNA computing
A Discreet, Fault-Tolerant, and Scalable Software Architectural Style for Internet-Sized Networks
ICSE COMPANION '07 Companion to the proceedings of the 29th International Conference on Software Engineering
An Architectural Style for Solving Computationally Intensive Problems on Large Networks
SEAMS '07 Proceedings of the 2007 International Workshop on Software Engineering for Adaptive and Self-Managing Systems
Fault and adversary tolerance as an emergent property of distributed systems' software architectures
Proceedings of the 2007 workshop on Engineering fault tolerant systems
Nondeterministic polynomial time factoring in the tile assembly model
Theoretical Computer Science
Solving NP-complete problems in the tile assembly model
Theoretical Computer Science
Solving satisfiability in the tile assembly model with a constant-size tileset
Journal of Algorithms
Path finding in the tile assembly model
Theoretical Computer Science
Crystal-growth-inspired algorithms for computational grids
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
Application of DNA Computing by Self-assembly on 0-1 Knapsack Problem
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III
Constant-size tileset for solving an NP-complete problem in nondeterministic linear time
DNA13'07 Proceedings of the 13th international conference on DNA computing
Improving efficiency of 3-SAT-solving tile systems
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Efficient 3-SAT algorithms in the tile assembly model
Natural Computing: an international journal
A molecular solution for minimum vertex cover problem in tile assembly model
The Journal of Supercomputing
| Hi-index | 5.23 |
Formalized study of self-assembly has led to the definition of the tile assembly model [Erik Winfree, Algorithmic self-assembly of DNA, Ph.D. Thesis, Caltech, Pasadena, CA, June 1998; Paul Rothemund, Erik Winfree, The program-size complexity of self-assembled squares, in: ACM Symposium on Theory of Computing, STOC02, Montreal, Quebec, Canada, 2001, pp. 459-468]. Research has identified two issues at the heart of self-assembling systems: the number of steps it takes for an assembly to complete, assuming maximum parallelism, and the minimal number of tiles necessary to assemble a shape. In this paper, I define the notion of a tile assembly system that computes a function, and tackle these issues for systems that compute the sum and product of two numbers. I demonstrate constructions of such systems with optimal @Q(1) distinct tile types and prove the assembly time is linear in the size of the input.