{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:39:32Z","timestamp":1725514772028},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694052"},{"type":"electronic","value":"9783540694076"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69407-6_38","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T13:39:35Z","timestamp":1213105175000},"page":"349-358","source":"Crossref","is-referenced-by-count":9,"title":["Computability and Complexity in Self-assembly"],"prefix":"10.1007","author":[{"given":"James I.","family":"Lathrop","sequence":"first","affiliation":[]},{"given":"Jack H.","family":"Lutz","sequence":"additional","affiliation":[]},{"given":"Matthew J.","family":"Patitz","sequence":"additional","affiliation":[]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Adleman, L.: Towards a mathematical theory of self-assembly, Tech. report, University of Southern California (2000)"},{"key":"38_CR2","unstructured":"Bachrach, J., Beal, J.: Building spatial computers, Tech. report, MIT CSAIL (2007)"},{"key":"38_CR3","unstructured":"Beal, J., Sussman, G.: Biologically-inspired robust spatial programming, Tech. report, MIT (2005)"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2307\/1994208","volume":"117","author":"J. Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Transactions of the American Mathematical Society\u00a0117, 285\u2013306 (1965)","journal-title":"Transactions of the American Mathematical Society"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. In: Proceedings of The Third Conference on Computability in Europe, Siena, Italy, June 18-23, 2007 (2007)","DOI":"10.1007\/978-3-540-73001-9_47"},{"key":"38_CR6","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. 1\u201321 (2002)","DOI":"10.1007\/3-540-45465-9_1"},{"key":"38_CR7","unstructured":"Paul, W.K.: Rothemund, Theory and experiments in algorithmic self-assembly, Ph.D. thesis, University of Southern California (December 2001)"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"38_CR9","doi-asserted-by":"publisher","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. Journal of Theoretical Biology\u00a099, 237\u2013247 (1982)","journal-title":"Journal of Theoretical Biology"},{"key":"38_CR10","doi-asserted-by":"publisher","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 Journal on Computing\u00a036, 1544\u20131569 (2007)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"38_CR11","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 \u2013 II. The Bell System Technical Journal\u00a0XL(1), 1\u201341 (1961)","journal-title":"The Bell System Technical Journal"},{"key":"38_CR12","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, Polytechnic Press of Polytechnic Inst. of Brooklyn, pp. 23\u201355 (1963)"},{"key":"38_CR13","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA, Ph.D. thesis, California Institute of Technology (June 1998)"}],"container-title":["Lecture Notes in Computer Science","Logic and Theory of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69407-6_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:38:34Z","timestamp":1620016714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69407-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540694052","9783540694076"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69407-6_38","relation":{},"subject":[]}}