A limit to the power of multiple nucleation in self-assembly

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5218 LNCS, Issue , 2008, Pages 451-465

  Sterling, Aaron D ^a  

^a Iowa State University   (United States)

Author keywords

Locally checkable labeling; Multiple nucleation; Self assembly

Indexed keywords

ASSEMBLY; BUILDING MATERIALS; COMPUTATIONAL COMPLEXITY; CUSTOMER SATISFACTION; POLYNOMIAL APPROXIMATION; SELF ASSEMBLY;

ASSEMBLY MODELS; ASSEMBLY SYSTEMS; COMPUTATIONAL POWERS; COMPUTATIONAL PROBLEMS; CONSTANT TIMES; DISTRIBUTED COMPUTING; DISTRIBUTED COMPUTING MODELS; LOCALLY CHECKABLE LABELING; LOW COMPLEXITIES; MULTIPLE NUCLEATION; NEW MODELS; POLYNOMIAL TIMES; SPEED-UP;

NUCLEATION;

EID: 56449118618     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87779-0_31     Document Type: Conference Paper

References (15)

1. Adleman, L., Cheng, Q., Goel, A., Huang, M.D.: Running time and program-size for self-assembled squares. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pp. 740-748 (2001)
2. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd edn. Series on Parallel and Distributed Computing. Wiley, Chichester (2004)
3. Aggarwal, G., Goldwasser, M., Kao, M.-Y., Schweller, R.: Complexities for Generalized Models of Self-Assembly. In: Proceedings of the fifteenth annual ACM-SIAM Symposium on Discrete Algorithms, pp. 880-889 (2004)
4. Cheng, Q., de Espanes, P.M.: Resolving two open problems in the self-assembly of squares. Technical Report 793, University of Southern California (2003)
5. Lathrop, J., Lutz, J., Patitz, M., Summers, S.: Computability and complexity in self-assembly. In: Logic and Theory of Algorithms: Proceedings of the Fourth Conference on Computability in Europe (to appear, 2008)
6. Lathrop, J., Lutz, J., Summers, S.: Strict self-assembly of discrete Sierpinski triangles. In: Computation and Logic in the Real World: Proceedings of the Third Conference on Computability in Europe, pp. 455-464. Springer, Heidelberg (2007)
7. Majumder, U., Reif, J., Sahu, S.: Stochastic Analysis of Reversible Self-Assembly. In: Computational and Theoretical Nanoscience (to appear, 2008)
8. Naor, M., Stockmeyer, L.: What can be computed locally? SIAM Journal of Computing 24(6), 1259-1277 (1995)
9. Patitz, M., Summers, S.: Self-assembly of discrete self-similar fractals. In: Proceedings of the Seventh International Conference on Unconventional Computation, Springer, Heidelberg (to appear, 2008)
10. Rothemund, P.W.K.: Theory and Experiments in Algorithmic Self-Assembly. Ph.D. thesis, University of Southern California, Los Angeles (2001)
11. Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 459-468 (2000)
12. Seeman, N.: Denovo design of sequences for nucleic-acid structural-engineering. Journal of Biomolecular Structure and Dynamics 8(3), 573-581 (1990)
13. Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM Journal of Computing 36(6), 1544-1569 (2007)
14. Wang, H.: Proving theorems by pattern recognition II. Bell Systems Technical Journal 40, 1-41 (1961)
15. Winfree, E.: Algorithmic Self-Assembly of DNA. Ph.D. thesis, California Institute of Technology, Pasadena (1998)