{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:17:27Z","timestamp":1725538647193},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030758"},{"type":"electronic","value":"9783642030765"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03076-5_12","type":"book-chapter","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T01:54:49Z","timestamp":1254794089000},"page":"144-155","source":"Crossref","is-referenced-by-count":4,"title":["Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes"],"prefix":"10.1007","author":[{"given":"Florent","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"R\u00e9mila","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Schabanel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Cheng, Q., Goel, A., Huang, M.-D.A.: Running time and program size for self-assembled squares. In: STOC 2001: Proc. of the 33rd ACM symposium on Theory of computing, pp. 740\u2013748 (2001)","DOI":"10.1145\/380752.380881"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Becker, F., Rapaport, I., R\u00e9mila, E.: Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time. In: LNCS Proc. of Found. of Software Tech. and Theo. Comp. Sci., pp. 45\u201356 (2006)","DOI":"10.1007\/11944836_7"},{"key":"12_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: STOC 2000: Proceedings of the 32nd symp. on Theory of computing, pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"12_CR5","unstructured":"Rothemund, P.W.K.: Theory and Experiments in Algorithmic Self-Assembly. PhD thesis, University of Southern California (2001)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/11493785_30","volume-title":"DNA Computing","author":"D. Soloveichik","year":"2005","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol.\u00a03384, pp. 344\u2013354. Springer, Heidelberg (2005)"},{"key":"12_CR7","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, Caltech (1998)"},{"key":"12_CR8","unstructured":"Winfree, E.: Simulations of computing by self-assembly. In: Proceedings of the Fourth DIMACS Meeting on DNA Based Computing, pp. 213\u2013242 (1998)"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03076-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T04:02:39Z","timestamp":1552190559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03076-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030758","9783642030765"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03076-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}