{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:49:51Z","timestamp":1725749391439},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319019277"},{"type":"electronic","value":"9783319019284"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-01928-4_13","type":"book-chapter","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T15:44:15Z","timestamp":1379519055000},"page":"174-188","source":"Crossref","is-referenced-by-count":6,"title":["Staged Self-assembly and Polyomino Context-Free Grammars"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Winslow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L., Cheng, Q., Goel, A., Huang, M.-D.: Running time and program size for self-assembled squares. In: Proceedings of Symposium on Theory of Computing, STOC (2001)","DOI":"10.1145\/380752.380881"},{"key":"13_CR2","unstructured":"Cannon, S., Demaine, E.D., Demaine, M.L., Eisenstat, S., Patitz, M.J., Schweller, R.T., Summers, S.M., Winslow, A.: Two hands are better than one (up to constant factors): Self-assembly in the 2HAM vs. aTAM. In: Proceedings of International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol.\u00a020, pp. 172\u2013184 (2013)"},{"issue":"7","key":"13_CR3","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M. Charikar","year":"2005","unstructured":"Charikar, M., Lehman, E., Lehman, A., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Transactions on Information Theory\u00a051(7), 2554\u20132576 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Chen, H.L., Doty, D.: Parallelism and time in hierarchical self-assembly. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA (2012)","DOI":"10.1137\/1.9781611973099.92"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Cook, M., Fu, Y., Schweller, R.: Temperature 1 self-assembly: determinstic assembly in 3D and probabilistic assembly in 2D. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA) (2011)","DOI":"10.1137\/1.9781611973082.45"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11047-008-9073-0","volume":"7","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Demaine, M.L., Fekete, S., Ishaque, M., Rafalin, E., Schweller, R., Souvaine, D.: Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues. Natural Computing\u00a07(3), 347\u2013370 (2008)","journal-title":"Natural Computing"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Eisenstat, S., Ishaque, M., Winslow, A.: One-dimensional staged self-assembly. Natural Computing (2012)","DOI":"10.1007\/978-3-642-23638-9_10"},{"key":"13_CR8","unstructured":"Doty, D., Lutz, J.H., Patitz, M.J., Schweller, R.T., Summers, S.M., Woods, D.: Intrinsic universality in self-assembly. In: Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol.\u00a05, pp. 275\u2013286 (2010)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Doty, D., Lutz, J.H., Patitz, M.J., Schweller, R.T., Summers, S.M., Woods, D.: The tile assembly model is intrinsically universal. In: Proceedings of Foundations of Computer Science (FOCS), pp. 302\u2013310 (2012)","DOI":"10.1109\/FOCS.2012.76"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Je\u017c, A.: Approximation of grammar-based compression via recompression. Technical report, arXiv (2013)","DOI":"10.1007\/978-3-642-38905-4_17"},{"key":"13_CR11","unstructured":"Lehman, E.: Approximation Algorithms for Grammar-Based Data Compression. PhD thesis. MIT (2002)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of Symposium on Theory of Computing (STOC), pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"13_CR13","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 11. LNCS, vol.\u00a03384, pp. 344\u2013354. Springer, Heidelberg (2005)"},{"key":"13_CR14","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, Caltech (1998)"}],"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-319-01928-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T11:58:36Z","timestamp":1558094316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-01928-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319019277","9783319019284"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-01928-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}