{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:27:34Z","timestamp":1743010054706,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"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_8","type":"book-chapter","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:22:02Z","timestamp":1633929722000},"page":"116-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fractal Dimension of Assemblies in the Abstract Tile Assembly Model"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Hader","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9287-4028","authenticated-orcid":false,"given":"Matthew J.","family":"Patitz","sequence":"additional","affiliation":[]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,11]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-08123-6_3","volume-title":"Unconventional Computation and Natural Computation","author":"K Barth","year":"2014","unstructured":"Barth, K., Furcy, D., Summers, S.M., Totzke, P.: Scaled tree fractals do not strictly self-assemble. In: Ibarra, O.H., Kari, L., Kopecki, S. (eds.) UCNC 2014. LNCS, vol. 8553, pp. 27\u201339. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08123-6_3"},{"key":"8_CR2","unstructured":"Cannon, S., et al.: Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM. In: Portier, N., Wilke, T. (eds.) STACS, volume 20 of LIPIcs, pp. 172\u2013184. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-015-0022-x","volume":"76","author":"CT Chalk","year":"2015","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), 1\u201330 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0022-x","journal-title":"Algorithmica"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-39206-1_34","volume-title":"Automata, Languages, and Programming","author":"ED Demaine","year":"2013","unstructured":"Demaine, E.D., Patitz, M.J., Rogers, T.A., Schweller, R.T., Summers, S.M., Woods, D.: The two-handed tile assembly model is not intrinsically universal. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 400\u2013412. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_34"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11549345_25","volume-title":"Mathematical Foundations of Computer Science 2005","author":"D Doty","year":"2005","unstructured":"Doty, D., Gu, X., Lutz, J.H., Mayordomo, E., Moser, P.: Zeta-Dimension. In: J\u0229drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 283\u2013294. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549345_25"},{"key":"8_CR6","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 the 53rd Annual IEEE Symposium on Foundations of Computer Science. FOCS 2012, pp. 302\u2013310 (2012)","DOI":"10.1109\/FOCS.2012.76"},{"key":"8_CR7","unstructured":"Evans, C.G.: Crystals that count! Physical principles and experimental investigations of DNA tile self-assembly. Ph.D. thesis, California Institute of Technology (2014)"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s11047-015-9528-z","volume":"16","author":"D Furcy","year":"2015","unstructured":"Furcy, D., Summers, S.M.: Scaled pier fractals do not strictly self-assemble. Nat. Comput. 16(2), 317\u2013338 (2015). https:\/\/doi.org\/10.1007\/s11047-015-9528-z","journal-title":"Nat. Comput."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Trans. Am. Math. Soc. 117, 285\u2013306 (1965)","journal-title":"Trans. Am. Math. Soc."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-030-00030-1_6","volume-title":"DNA Computing and Molecular Programming","author":"J Hendricks","year":"2018","unstructured":"Hendricks, J., Opseth, J., Patitz, M.J., Summers, S.M.: Hierarchical growth is necessary and\u00a0(sometimes) sufficient to\u00a0self-assemble discrete self-similar fractals. In: Doty, D., Dietz, H. (eds.) DNA 2018. LNCS, vol. 11145, pp. 87\u2013104. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00030-1_6"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-319-43994-5_6","volume-title":"DNA Computing and Molecular Programming","author":"J Hendricks","year":"2016","unstructured":"Hendricks, J., Olsen, M., Patitz, M.J., Rogers, T.A., Thomas, H.: Hierarchical self-assembly of fractals with signal-passing tiles (extended abstract). In: Rondelez, Y., Woods, D. (eds.) DNA 2016. LNCS, vol. 9818, pp. 82\u201397. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43994-5_6"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-319-58187-3_9","volume-title":"Unconventional Computation and Natural Computation","author":"J Hendricks","year":"2017","unstructured":"Hendricks, J., Opseth, J.: Self-assembly of 4-sided fractals in the two-handed tile assembly model. In: Patitz, M.J., Stannett, M. (eds.) UCNC 2017. LNCS, vol. 10240, pp. 113\u2013128. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58187-3_9"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Hendricks, J., Patitz, M.J., Rogers, T.A.: Universal simulation of directed systems in the abstract tile assembly model requires undirectedness. In: Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016), New Brunswick, New Jersey, USA 9\u201311 October 2016, pp. 800\u2013809 (2016)","DOI":"10.1109\/FOCS.2016.90"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-10604-0_8","volume-title":"DNA Computing and Molecular Programming","author":"SM Kautz","year":"2009","unstructured":"Kautz, S.M., Lathrop, J.I.: Self-assembly of the discrete Sierpinski carpet and related fractals. In: Deaton, R., Suyama, A. (eds.) DNA 2009. LNCS, vol. 5877, pp. 78\u201387. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10604-0_8"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00453-012-9691-x","volume":"67","author":"SM Kautz","year":"2013","unstructured":"Kautz, S.M., Shutters, B.: Self-assembling rulers for approximating generalized Sierpinski carpets. Algorithmica 67(2), 207\u2013233 (2013)","journal-title":"Algorithmica"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s00224-010-9252-0","volume":"48","author":"JI Lathrop","year":"2011","unstructured":"Lathrop, J.I., Lutz, J.H., Patitz, M.J., Summers, S.M.: Computability and complexity in self-assembly. Theory Comput. Syst. 48(3), 617\u2013647 (2011)","journal-title":"Theory Comput. Syst."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.tcs.2008.09.062","volume":"410","author":"JI Lathrop","year":"2009","unstructured":"Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. Theoret. Comput. Sci. 410, 384\u2013405 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/s00224-011-9345-4","volume":"51","author":"JH Lutz","year":"2012","unstructured":"Lutz, J.H., Shutters, B.: Approximate self-assembly of the Sierpinski triangle. Theory Comput. Syst. 51(3), 372\u2013400 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"8_CR19","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1142\/S0129054114400061","volume":"25","author":"JE Padilla","year":"2014","unstructured":"Padilla, J.E., Patitz, M.J., Schweller, R.T., Seeman, N.C., Summers, S.M., Zhong, X.: Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes. Int. J. Found. Comput. Sci. 25(4), 459\u2013488 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11047-009-9147-7","volume":"1","author":"MJ Patitz","year":"2010","unstructured":"Patitz, M.J., Summers, S.M.: Self-assembly of discrete self-similar fractals. Nat. Comput. 1, 135\u2013172 (2010)","journal-title":"Nat. Comput."},{"issue":"2","key":"8_CR21","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s11047-010-9218-9","volume":"10","author":"MJ Patitz","year":"2011","unstructured":"Patitz, M.J., Summers, S.M.: Self-assembly of decidable sets. Nat. Comput. 10(2), 853\u2013877 (2011)","journal-title":"Nat. Comput."},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Patitz, M.J., Summers, S.M.: Self-assembly of infinite structures: a survey. Theor. Comput. Sci. 412(1-2), 159\u2013165 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.08.015","DOI":"10.1016\/j.tcs.2010.08.015"},{"issue":"12","key":"8_CR23","doi-asserted-by":"publisher","first-page":"e424","DOI":"10.1371\/journal.pbio.0020424","volume":"2","author":"PWK Rothemund","year":"2004","unstructured":"Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol. 2(12), e424 (2004)","journal-title":"PLoS Biol."},{"key":"8_CR24","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 Thirty-second Annual ACM Symposium on Theory of Computing, pp. 459\u2013468, Portland, Oregon, United States. ACM (2000)","DOI":"10.1145\/335305.335358"},{"issue":"6","key":"8_CR25","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 J. Comput. 36(6), 1544\u20131569 (2007)","journal-title":"SIAM J. Comput."},{"key":"8_CR26","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. Ph.D. thesis, California Institute of Technology, June 1998"},{"key":"8_CR27","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, 366\u2013372 (2019)","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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:43:46Z","timestamp":1633931026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87993-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030879921","9783030879938"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87993-8_8","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"}}]}}