{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T11:49:49Z","timestamp":1778672989053,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,4,20]],"date-time":"2010-04-20T00:00:00Z","timestamp":1271721600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s00224-010-9252-0","type":"journal-article","created":{"date-parts":[[2010,4,19]],"date-time":"2010-04-19T09:44:07Z","timestamp":1271670247000},"page":"617-647","source":"Crossref","is-referenced-by-count":32,"title":["Computability and Complexity in Self-assembly"],"prefix":"10.1007","volume":"48","author":[{"given":"James I.","family":"Lathrop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack H.","family":"Lutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Patitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,20]]},"reference":[{"key":"9252_CR1","unstructured":"Adleman, L.: Towards a mathematical theory of self-assembly. Tech. Report, University of Southern California (2000)"},{"key":"9252_CR2","unstructured":"Bachrach, J., Beal, J.: Building spatial computers. Tech. Report, MIT CSAIL (2007)"},{"key":"9252_CR3","unstructured":"Beal, J., Sussman, G.: Biologically-inspired robust spatial programming. Tech. Report, MIT (2005)"},{"key":"9252_CR4","unstructured":"Cheng, Q., Goel, A., Moisset\u00a0de\u00a0Espan\u00e9s, P.: Optimal self-assembly of counters at temperature two. In: Proceedings of the First Conference on Foundations of Nanoscience: Self-assembled Architectures and Devices (2004)"},{"key":"9252_CR5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J. Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Trans. Am. Math. Soc. 117, 285\u2013306 (1965)","journal-title":"Trans. Am. Math. Soc."},{"key":"9252_CR6","first-page":"141","volume":"25","author":"S. Irani","year":"1992","unstructured":"Irani, S., Naor, M., Rubinfeld, R.: On the time and space complexity of computation using write-once memories, or Is pen really much worse than pencil? Theory Comput. Syst. 25, 141\u2013159 (1992)","journal-title":"Theory Comput. Syst."},{"key":"9252_CR7","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/j.tcs.2008.09.062","volume":"410","author":"J.I. Lathrop","year":"2009","unstructured":"Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. Theor. Comput. Sci. 410, 384\u2013405 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9252_CR8","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: Molecular assembly and computation: from theory to experimental demonstrations. In: Proceedings of the Twenty-Ninth International Colloquium on Automata, Languages and Programming, pp.\u00a01\u201321 (2002)","DOI":"10.1007\/3-540-45465-9_1"},{"key":"9252_CR9","unstructured":"Rothemund, P.W.K.: Theory and experiments in algorithmic self-assembly. Ph.D. Thesis, University of Southern California, December 2001"},{"key":"9252_CR10","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1145\/335305.335358","volume-title":"STOC\u201900: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing","author":"P.W.K. Rothemund","year":"2000","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: STOC\u201900: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp.\u00a0459\u2013468. ACM, New York (2000)"},{"key":"9252_CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0022-5193(82)90002-9","volume":"99","author":"N.C. Seeman","year":"1982","unstructured":"Seeman, N.C.: Nucleic-acid junctions and lattices. J.\u00a0Theor. Biol. 99, 237\u2013247 (1982)","journal-title":"J.\u00a0Theor. Biol."},{"issue":"6","key":"9252_CR12","doi-asserted-by":"crossref","first-page":"1544","DOI":"10.1137\/S0097539704446712","volume":"36","author":"D. Soloveichik","year":"2007","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM J. Comput. 36(6), 1544\u20131569 (2007)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9252_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"XL","author":"H. Wang","year":"1961","unstructured":"Wang, H.: Proving theorems by pattern recognition\u2014II. Bell Syst. Tech. J. XL(1), 1\u201341 (1961)","journal-title":"Bell Syst. Tech. J."},{"key":"9252_CR14","first-page":"23","volume-title":"Proceedings of the Symposium on Mathematical Theory of Automata","author":"H. Wang","year":"1963","unstructured":"Wang, H.: Dominoes and the AEA case of the decision problem. In: Proceedings of the Symposium on Mathematical Theory of Automata, New York, 1962, pp.\u00a023\u201355. Polytechnic Inst. of Brooklyn, Brooklyn (1963)"},{"key":"9252_CR15","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. Thesis, California Institute of Technology, June 1998"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9252-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-010-9252-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9252-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:10:40Z","timestamp":1559038240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-010-9252-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,20]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9252"],"URL":"https:\/\/doi.org\/10.1007\/s00224-010-9252-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,20]]}}}