{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T11:18:15Z","timestamp":1648811895369},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5737,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0304-3975(96)00211-3","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"45-57","source":"Crossref","is-referenced-by-count":3,"title":["Linear speed-up for cellular automata synchronizers and applications"],"prefix":"10.1016","volume":"188","author":[{"given":"Olivier","family":"Heen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00211-3_BIB1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/S0019-9958(67)90032-0","article-title":"An 8-states minimal time solution to the firing squad synchronization problem","volume":"10","author":"Balzer","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(96)00211-3_BIB2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00264617","article-title":"On real-time cellular automata and treillis automata","volume":"21","author":"Choffrut","year":"1984","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(96)00211-3_BIB3","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/T-C.1969.222663","article-title":"Real-time computation by n-dimensional arrays of finite-state machines","volume":"C 18","author":"Cole","year":"1969","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(96)00211-3_BIB4","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1145\/321281.321290","article-title":"Generation of primes by a one-dimensional real-time iterative array","volume":"12","author":"Fisher","year":"1965","journal-title":"JACM"},{"key":"10.1016\/S0304-3975(96)00211-3_BIB5","article-title":"Acc\u00e9l\u00e9ration d'une constante sur automates cellulaires et applications","author":"Heen","year":"1995"},{"key":"10.1016\/S0304-3975(96)00211-3_BIB6","article-title":"Linear speed-up without synchronization","author":"Heen","year":"1995"},{"key":"10.1016\/S0304-3975(96)00211-3_BIB7","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1137\/0214033","article-title":"Sequential machine characterization of treillis and cellular automata and application","volume":"14","author":"Ibarra","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00211-3_BIB8","series-title":"The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/S0304-3975(96)00211-3_BIB9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(87)90124-1","article-title":"A 6-state minimal-time solution to the firing squad synchronisation problem","volume":"50","author":"Mazoyer","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00211-3_BIB10","article-title":"Solutions au probl\u00e8me de la synchronisation d'une ligne de fusiliers: \u00e9tude de leur structure","author":"Mazoyer","year":"1990","journal-title":"Rapport d'habilitation"},{"key":"10.1016\/S0304-3975(96)00211-3_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(92)90150-E","article-title":"A linear speed-up theorem for cellular automata","volume":"101","author":"Mazoyer","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00211-3_BIB12","series-title":"Computation, Finite and Infinite Machines","author":"Minsky","year":"1967"},{"key":"10.1016\/S0304-3975(96)00211-3_BIB13","series-title":"Sequential Machines, Selected Papers","author":"Moore","year":"1964"},{"key":"10.1016\/S0304-3975(96)00211-3_BIB14","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0304-3975(94)90045-0","article-title":"Seven-state solutions to the firing squad synchronization problem","volume":"127","author":"Yun\u00e8s","year":"1994","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002113?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002113?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:26:03Z","timestamp":1556508363000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0304397596002113"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00211-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}