{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:51:42Z","timestamp":1725576702657},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183041"},{"type":"electronic","value":"9783642183058"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18305-8_10","type":"book-chapter","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T01:58:40Z","timestamp":1295575120000},"page":"100-111","source":"Crossref","is-referenced-by-count":0,"title":["Randomized Self Assembly of Rectangular Nano Structures"],"prefix":"10.1007","author":[{"given":"Vamsi","family":"Kundeti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanguthevar","family":"Rajasekaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/11944836_7","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"F. Becker","year":"2006","unstructured":"Becker, F., Rapaport, I., R\u00e9mila, \u00c9.: Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 45\u201356. Springer, Heidelberg (2006)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-70575-8_31","volume-title":"Automata, Languages and Programming","author":"M.-Y. Kao","year":"2008","unstructured":"Kao, M.-Y., Schweller, R.T.: Randomized self-assembly for approximate shapes. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 370\u2013384. Springer, Heidelberg (2008)"},{"key":"10_CR3","first-page":"85","volume-title":"Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"D. Doty","year":"2009","unstructured":"Doty, D.: Randomized self-assembly for exact shapes. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 85\u201394. IEEE, Los Alamitos (2009)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of dna sierpinski triangles. PLoS Biology\u00a02(12) (2004)","DOI":"10.1371\/journal.pbio.0020424"},{"key":"10_CR5","unstructured":"Winfree, E.: Algorithmic self-assembly of dna. dissertation (ph.d.), california institute of technology (1998), http:\/\/resolver.caltech.edu\/CaltechETD:etd-05192003-110022"},{"key":"10_CR6","unstructured":"Wang, H.: An unsolvable problem on dominoes. Technical Report BL-30 (1962)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: Program-size complexity of self-assembled squares. In: ACM Symposium on Theory of Computation (STOC), pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Adleman, L., Cheng, Q., Goel, A., Huang, M.: Running time and program size for self-assembled squares. In: Annual ACM Symposium on Theory of Computing, pp. 740\u2013748 (2001)","DOI":"10.1145\/380752.380881"},{"issue":"6","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/S0097539704445202","volume":"34","author":"G. Aggarwal","year":"2005","unstructured":"Aggarwal, G., Cheng, Q.I., Goldwasser, M.H., Kao, M., De Espanes, P.M., Schweller, R.T.: Complexities for generalized models of self-assembly. SIAM Journal on Computing\u00a034(6), 1493\u20131515 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Kao, M., Schweller, R.: Reducing tile complexity for self-assembly through temperature programming. In: Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 571\u2013580 (2006)","DOI":"10.1145\/1109557.1109620"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18305-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:21:57Z","timestamp":1559942517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18305-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183041","9783642183058"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18305-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}