{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:44:22Z","timestamp":1767138262274,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030193102","type":"print"},{"value":"9783030193119","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19311-9_16","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"191-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Geometric Tiles and Powers and Limitations of Geometric Hindrance in Self-assembly"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Hader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Patitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,26]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Cook, M., Fu, Y., Schweller, R.T.: Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D. In: SODA 2011: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM (2011)","DOI":"10.1137\/1.9781611973082.45"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-662-43948-7_31","volume-title":"Automata, Languages, and Programming","author":"ED Demaine","year":"2014","unstructured":"Demaine, E.D., et al.: One tile to rule them all: simulating\u00a0any\u00a0tile\u00a0assembly\u00a0system with\u00a0a\u00a0single\u00a0universal\u00a0tile. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 368\u2013379. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-662-43948-7_31"},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00453-012-9631-9","volume":"66","author":"D Doty","year":"2013","unstructured":"Doty, D., Kari, L., Masson, B.: Negative interactions in irreversible self-assembly. Algorithmica 66(1), 153\u2013172 (2013)","journal-title":"Algorithmica"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tcs.2010.08.023","volume":"412","author":"D Doty","year":"2011","unstructured":"Doty, D., Patitz, M.J., Summers, S.M.: Limitations of self-assembly at temperature 1. Theor. Comput. Sci. 412, 145\u2013158 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Fekete, S.P., Hendricks, J., Patitz, M.J., Rogers, T.A., Schweller, R.T.: Universal computation with arbitrary polyomino tiles in non-cooperative self-assembly. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 4\u20136 January 2015, pp. 148\u2013167 (2015). \n                    https:\/\/doi.org\/10.1137\/1.9781611973730.12","DOI":"10.1137\/1.9781611973730.12"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/978-3-642-31594-7_60","volume-title":"Automata, Languages, and Programming","author":"B Fu","year":"2012","unstructured":"Fu, B., Patitz, M.J., Schweller, R.T., Sheline, R.: Self-assembly with geometric tiles. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 714\u2013725. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-31594-7_60"},{"key":"16_CR7","unstructured":"Gilber, O., Hendricks, J., Patitz, M.J., Rogers, T.A.: Computing in continuous space with self-assembling polygonal tiles. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 10\u201312 January 2016, pp. 937\u2013956 (2016)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-19311-9_16","volume-title":"Unconventional Computation and Natural Computation","author":"Daniel Hader","year":"2019","unstructured":"Hader, D., Patitz, M.J.: Geometric tiles and powers and limitations of geometric hindrance in self-assembly. Technical report 1903.05774, Computing Research Repository (2019). \n                    http:\/\/arxiv.org\/abs\/1903.05774"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s11047-015-9513-6","volume":"15","author":"J Hendricks","year":"2016","unstructured":"Hendricks, J., Patitz, M.J., Rogers, T.A.: Doubles and negatives are positive (in self-assembly). Nat. Comput. 15(1), 69\u201385 (2016). \n                    https:\/\/doi.org\/10.1007\/s11047-015-9513-6","journal-title":"Nat. Comput."},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2015.12.008","volume":"743","author":"Jacob Hendricks","year":"2018","unstructured":"Hendricks, J., Patitz, M.J., Rogers, T.A., Summers, S.M.: The power of duples (in self-assembly): it\u2019s not so hip to be square. Theor. Comput. Sci. (2015). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2015.12.008\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S030439751501169X","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"16_CR11","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":"16_CR12","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. Theor. Comput. Sci. 410, 384\u2013405 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s11047-018-9707-9","volume":"18","author":"Austin Luchsinger","year":"2018","unstructured":"Luchsinger, A., Schweller, R., Wylie, T.: Self-assembly of shapes at constantscale using repulsive forces. Nat. Comput. (2018). \n                    https:\/\/doi.org\/10.1007\/s11047-018-9707-9","journal-title":"Natural Computing"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-319-58187-3_7","volume-title":"Unconventional Computation and Natural Computation","author":"A Luchsinger","year":"2017","unstructured":"Luchsinger, A., Schweller, R., Wylie, T.: Self-assembly of shapes at constant scale using repulsive forces. In: Patitz, M.J., Stannett, M. (eds.) UCNC 2017. LNCS, vol. 10240, pp. 82\u201397. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-58187-3_7"},{"key":"16_CR15","unstructured":"Meunier, P.E., Patitz, M.J., Summers, S.M., Theyssier, G., Winslow, A., Woods, D.: Intrinsic universality in tile self-assembly requires cooperation. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), Portland, OR, USA, 5\u20137 January 2014, pp. 752\u2013771 (2014)"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Meunier, P., Woods, D.: The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, 19\u201323 June 2017, pp. 328\u2013341 (2017). \n                    https:\/\/doi.org\/10.1145\/3055399.3055446","DOI":"10.1145\/3055399.3055446"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-23638-9_15","volume-title":"DNA Computing and Molecular Programming","author":"MJ Patitz","year":"2011","unstructured":"Patitz, M.J., Schweller, R.T., Summers, S.M.: Exact shapes and turing universality at temperature 1 with a single negative glue. In: Cardelli, L., Shih, W. (eds.) DNA 2011. LNCS, vol. 6937, pp. 175\u2013189. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-23638-9_15"},{"key":"16_CR18","doi-asserted-by":"publisher","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. ACM, Portland (2000). \n                    https:\/\/doi.org\/10.1145\/335305.335358","DOI":"10.1145\/335305.335358"},{"issue":"6","key":"16_CR19","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":"16_CR20","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology, June 1998"}],"updated-by":[{"DOI":"10.1007\/978-3-030-19311-9_22","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:00:00Z","timestamp":1558915200000}}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19311-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T03:20:16Z","timestamp":1570764016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19311-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030193102","9783030193119"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19311-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"27 May 2019","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The original version of this paper contained a mistake. Theorem 3 in \u201cSection 4,\u201d which claimed that for every temperature-1 system in the Dupled abstract Tile Assembly Model (DaTAM) there exists a temperature-1 system in the Geometric Tile Assembly Model (GTAM) which simulates it at scale factor 1 and using only 2 glues, was incorrect. That theorem and the section that contained it have been removed. Please note that that result was independent of all other results, and the fact that it was incorrect does not impact them or any of the other remaining portions of the paper.","order":4,"name":"change_details","label":"Change Details","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":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ucnc2019.uec.ac.jp\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 abstracts of invited talks and one full paper of an invited talk are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}