{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:53:34Z","timestamp":1743090814681,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030879921"},{"type":"electronic","value":"9783030879938"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87993-8_1","type":"book-chapter","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:22:02Z","timestamp":1633929722000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Multiple Handed Self-assembly"],"prefix":"10.1007","author":[{"given":"David","family":"Caballero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy","family":"Gomez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,11]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., et al.: Combinatorial optimization problems in self-assembly. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 23\u201332 (2002)","DOI":"10.1145\/509907.509913"},{"issue":"6","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/S0097539704445202","volume":"34","author":"G Aggarwal","year":"2005","unstructured":"Aggarwal, G., Cheng, Q., Goldwasser, M.H., Kao, M.Y., de Espanes, P.M., Schweller, R.T.: Complexities for generalized models of self-assembly. SIAM J. Comput. 34(6), 1493\u20131515 (2005). https:\/\/doi.org\/10.1137\/S0097539704445202","journal-title":"SIAM J. Comput."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17, 209\u2013223 (1997). https:\/\/doi.org\/10.1007\/BF02523189","journal-title":"Algorithmica"},{"key":"1_CR4","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. 4337, pp. 45\u201356. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11944836_7"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bryans, N., Chiniforooshan, E., Doty, D., Kari, L., Seki, S.: The power of nondeterminism in self-assembly. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 590\u2013602. SIAM (2011)","DOI":"10.1137\/1.9781611973082.46"},{"key":"1_CR6","unstructured":"Cannon, S., et al.: Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM. In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), vol. 20, pp. 172\u2013184. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)"},{"key":"1_CR7","unstructured":"Chalk, C., Luchsinger, A., Schweller, R., Wylie, T.: Self-assembly of any shape with constant tile types using high temperature. In: Proceedings of the 26th Annual European Symposium on Algorithms, ESA 2018 (2018)"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00453-015-0022-x","volume":"76","author":"CT Chalk","year":"2016","unstructured":"Chalk, C.T., Fernandez, D.A., Huerta, A., Maldonado, M.A., Schweller, R.T., Sweet, L.: Strict self-assembly of fractals using multiple hands. Algorithmica 76(1), 195\u2013224 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0022-x","journal-title":"Algorithmica"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11047-008-9073-0","volume":"7","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., et al.: Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues. Nat. Comput. 7(3), 347\u2013370 (2008). https:\/\/doi.org\/10.1007\/s11047-008-9073-0","journal-title":"Nat. Comput."},{"issue":"8","key":"1_CR10","doi-asserted-by":"publisher","first-page":"3521","DOI":"10.1137\/090779152","volume":"39","author":"D Doty","year":"2010","unstructured":"Doty, D.: Randomized self-assembly for exact shapes. SIAM J. Comput. 39(8), 3521\u20133552 (2010)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"1_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2380656.2380675","volume":"55","author":"D Doty","year":"2012","unstructured":"Doty, D.: Theory of algorithmic self-assembly. Commun. ACM 55(12), 78\u201388 (2012)","journal-title":"Commun. ACM"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-319-08123-6_12","volume-title":"Unconventional Computation and Natural Computation","author":"D Doty","year":"2014","unstructured":"Doty, D.: Producibility in hierarchical self-assembly. In: Ibarra, O.H., Kari, L., Kopecki, S. (eds.) UCNC 2014. LNCS, vol. 8553, pp. 142\u2013154. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08123-6_12"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3), 1\u201327 (1999). https:\/\/doi.org\/10.7155\/jgaa.00014","journal-title":"J. Graph Algorithms Appl."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-662-48971-0_26","volume-title":"Algorithms and Computation","author":"SP Fekete","year":"2015","unstructured":"Fekete, S.P., Schweller, R.T., Winslow, A.: Size-dependent tile self-assembly: constant-height rectangles and stability. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 296\u2013306. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_26"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Kao, M.Y., Schweller, R.: Reducing tile complexity for self-assembly through temperature programming. arXiv preprint cs\/0602010 (2006)","DOI":"10.1145\/1109557.1109620"},{"key":"1_CR16","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.: 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. LNCS, vol. 5125, pp. 370\u2013384. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_31"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-39890-5_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"\u0141 Kowalik","year":"2003","unstructured":"Kowalik, \u0141: Short cycles in planar graphs. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 284\u2013296. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39890-5_25"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11047-012-9313-1","volume":"11","author":"V Kundeti","year":"2012","unstructured":"Kundeti, V., Rajasekaran, S.: Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models. Nat. Comput. 11(2), 199\u2013207 (2012). https:\/\/doi.org\/10.1007\/s11047-012-9313-1","journal-title":"Nat. Comput."},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-021-21755-7","volume":"12","author":"D Minev","year":"2021","unstructured":"Minev, D., Wintersinger, C.M., Ershova, A., Shih, W.M.: Robust nucleation control via crisscross polymerization of highly coordinated DNA slats. Nat. Commun. 12(1), 1\u20139 (2021)","journal-title":"Nat. Commun."},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11047-013-9379-4","volume":"13","author":"MJ Patitz","year":"2013","unstructured":"Patitz, M.J.: An introduction to tile-based self-assembly and a survey of recent results. Nat. Comput. 13(2), 195\u2013224 (2013). https:\/\/doi.org\/10.1007\/s11047-013-9379-4","journal-title":"Nat. Comput."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-66799-7_7","volume-title":"DNA Computing and Molecular Programming","author":"R Schweller","year":"2017","unstructured":"Schweller, R., Winslow, A., Wylie, T.: Complexities for high-temperature two-handed tile self-assembly. In: Brijder, R., Qian, L. (eds.) DNA 2017. LNCS, vol. 10467, pp. 98\u2013109. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66799-7_7"},{"issue":"8","key":"1_CR23","doi-asserted-by":"publisher","first-page":"3114","DOI":"10.1007\/s00453-019-00573-w","volume":"81","author":"R Schweller","year":"2019","unstructured":"Schweller, R., Winslow, A., Wylie, T.: Nearly constant tile complexity for any shape in two-handed tile assembly. Algorithmica 81(8), 3114\u20133135 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00573-w","journal-title":"Algorithmica"},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s11047-018-9701-2","volume":"18","author":"R Schweller","year":"2018","unstructured":"Schweller, R., Winslow, A., Wylie, T.: Verification in staged tile self-assembly. Nat. Comput. 18(1), 107\u2013117 (2018). https:\/\/doi.org\/10.1007\/s11047-018-9701-2","journal-title":"Nat. Comput."},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00453-011-9522-5","volume":"63","author":"SM Summers","year":"2012","unstructured":"Summers, S.M.: Reducing tile complexity for the self-assembly of scaled shapes through temperature programming. Algorithmica 63(1), 117\u2013136 (2012). https:\/\/doi.org\/10.1007\/s00453-011-9522-5","journal-title":"Algorithmica"},{"key":"1_CR26","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology, June 1998"},{"issue":"2046","key":"1_CR27","doi-asserted-by":"publisher","first-page":"20140214","DOI":"10.1098\/rsta.2014.0214","volume":"373","author":"D Woods","year":"2015","unstructured":"Woods, D.: Intrinsic universality and the computational power of self-assembly. Philos. Trans. Roy. Soc. A Math. Phys. Eng. Sci. 373(2046), 20140214 (2015)","journal-title":"Philos. Trans. Roy. Soc. A Math. Phys. Eng. Sci."},{"issue":"7748","key":"1_CR28","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1038\/s41586-019-1014-9","volume":"567","author":"D Woods","year":"2019","unstructured":"Woods, D., et al.: Diverse and robust molecular algorithms using reprogrammable DNA self-assembly. Nature 567(7748), 366\u2013372 (2019). https:\/\/doi.org\/10.1038\/s41586-019-1014-9","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87993-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:35:58Z","timestamp":1633930558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87993-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030879921","9783030879938"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87993-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Espoo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ucnc2021.cs.aalto.fi\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}