{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T01:35:20Z","timestamp":1749173720968,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030000295"},{"type":"electronic","value":"9783030000301"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-00030-1_10","type":"book-chapter","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T19:44:00Z","timestamp":1536263040000},"page":"155-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Freezing Simulates Non-freezing Tile Automata"],"prefix":"10.1007","author":[{"given":"Cameron","family":"Chalk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Austin","family":"Luchsinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Martinez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Winslow","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":[[2018,9,7]]},"reference":[{"key":"10_CR1","unstructured":"Becker, F., Maldonado, D., Ollinger, N., Theyssier, G.: Universality in freezing cellular automata. CoRR, abs\/1805.00059 (2018). http:\/\/arxiv.org\/abs\/1805.00059"},{"key":"10_CR2","unstructured":"Cannon, S., Demaine, E.D., et al.: Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM. In: STACS. LIPIcs, vol. 20, pp. 172\u2013184 (2013)"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/s00453-015-9976-y","volume":"74","author":"ED Demaine","year":"2016","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. Algorithmica 74(2), 812\u2013850 (2016)","journal-title":"Algorithmica"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-21999-8_8","volume-title":"DNA Computing and Molecular Programming","author":"Z Derakhshandeh","year":"2015","unstructured":"Derakhshandeh, Z., Gmyr, R., Strothmann, T., Bazzi, R., Richa, A.W., Scheideler, C.: Leader election and shape formation with self-organizing programmable matter. In: Phillips, A., Yin, P. (eds.) DNA 2015. LNCS, vol. 9211, pp. 117\u2013132. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21999-8_8"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Doty, D., Lutz, J.H., Patitz, M.J., Schweller, R., Summers, S.M., Woods, D.: The tile assembly model is intrinsically universal. In: Proceedings of the 53rd Conference on Foundations of Computer Science, FOCS 2012 (2012)","DOI":"10.1109\/FOCS.2012.76"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-58631-1_9","volume-title":"Cellular Automata and Discrete Complex Systems","author":"E Goles","year":"2017","unstructured":"Goles, E., Maldonado, D., Montealegre, P., Ollinger, N.: On the computational complexity of the freezing non-strict majority automata. In: Dennunzio, A., Formenti, E., Manzoni, L., Porreca, A.E. (eds.) AUTOMATA 2017. LNCS, vol. 10248, pp. 109\u2013119. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58631-1_9"},{"key":"10_CR7","unstructured":"Goles, E., Ollinger, N., Theyssier, G.: Introducing freezing cellular automata. In: Cellular Automata and Discrete Complex Systems, AUTOMATA 2015, vol. 24, pp. 65\u201373 (2015)"},{"issue":"02","key":"10_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1142\/S0129054114500099","volume":"25","author":"N Jonaska","year":"2014","unstructured":"Jonaska, N., Karpenko, D.: Active tile self-assembly, part 2: self-similar structures and structural recursion. Int. J. Found. Comput. Sci. 25(02), 165\u2013194 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.11.021","volume":"334","author":"J Kari","year":"2005","unstructured":"Kari, J.: Theory of cellular automata: a survey. Theor. Comput. Sci. 334(1), 3\u201333 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1142\/S0129054114400061","volume":"25","author":"JE Padilla","year":"2014","unstructured":"Padilla, J.E., et al.: Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes. Int. J. Found. Comput. Sci. 25, 459 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"20","key":"10_CR11","doi-asserted-by":"publisher","first-page":"5939","DOI":"10.1002\/anie.201500252","volume":"54","author":"JE Padilla","year":"2015","unstructured":"Padilla, J.E., Sha, R., Kristiansen, M., Chen, J., Jonoska, N., Seeman, N.C.: A signal-passing DNA-strand-exchange mechanism for active self-assembly of DNA nanostructures. Angew. Chem. Int. Ed. 54(20), 5939\u20135942 (2015)","journal-title":"Angew. Chem. Int. Ed."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Woods, D., Chen, H.-L., Goodfriend, S., Dabby, N., Winfree, E., Yin, P.: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In: Innovations in Theoretical Computer Science, ITCS 2013, pp. 353\u2013354 (2013)","DOI":"10.1145\/2422436.2422476"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00030-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:42:54Z","timestamp":1709833374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00030-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030000295","9783030000301"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00030-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DNA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on DNA Computing and Molecular Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dna2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dna24sdnu.com\/","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":"14","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":"12","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":"86% - 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":"5","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":"3","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)"}}]}}