{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:31:04Z","timestamp":1743114664240,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-319-99813-8_37","type":"book-chapter","created":{"date-parts":[[2018,8,25]],"date-time":"2018-08-25T00:43:50Z","timestamp":1535157830000},"page":"406-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata"],"prefix":"10.1007","author":[{"given":"Eric","family":"Goles","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Maldonado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Montealegre-Barba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Ollinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,26]]},"reference":[{"key":"37_CR1","volume-title":"Computational Complexity","author":"CM Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.M.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"37_CR2","unstructured":"Goles, E., Ollinger, N., Theyssier, G.: Introducing freezing cellular automata. In: Cellular Automata and Discrete Complex Systems, 21st International Workshop (AUTOMATA 2015). TUCS Lecture Notes, Turku, Finland, vol. 24, pp. 65\u201373 (2015)"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2012.08.001","volume":"504","author":"E Goles","year":"2013","unstructured":"Goles, E., Montealegre-Barba, P., Todinca, I.: The complexity of the bootstraping percolation and other problems. Theor. Comput. Sci. 504, 73\u201382 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"37_CR4","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1103\/RevModPhys.55.601","volume":"55","author":"S Wolfram","year":"1983","unstructured":"Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601\u2013644 (1983)","journal-title":"Rev. Mod. Phys."},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-319-44365-2_16","volume-title":"Cellular Automata","author":"E Goles","year":"2016","unstructured":"Goles, E., Montealegre, P.: A fast parallel algorithm for the robust prediction of the two-dimensional strict majority automaton. In: El Yacoubi, S., W\u0105s, J., Bandini, S. (eds.) ACRI 2016. LNCS, vol. 9863, pp. 166\u2013175. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-44365-2_16"},{"key":"37_CR6","volume-title":"An Introduction to Parallel Algorithms","author":"J J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms. Addison Wesley Longman Publishing Co. Inc., Redwood City (1992)"},{"issue":"2","key":"37_CR7","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1137\/0211024","volume":"11","author":"J J\u00e1J\u00e1","year":"1982","unstructured":"J\u00e1J\u00e1, J., Simon, J.: Parallel algorithms in graph theory: planarity testing. SIAM J. Comput. 11(2), 314\u2013328 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99813-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T20:54:16Z","timestamp":1535921656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99813-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99813-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}