{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T11:27:58Z","timestamp":1725190078963},"reference-count":14,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3369,"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":[[2004,6]]},"DOI":"10.1016\/j.tcs.2004.01.036","type":"journal-article","created":{"date-parts":[[2004,2,27]],"date-time":"2004-02-27T10:22:03Z","timestamp":1077877323000},"page":"213-228","source":"Crossref","is-referenced-by-count":20,"title":["Bounding the firing synchronization problem on a ring"],"prefix":"10.1016","volume":"320","author":[{"given":"Andr\u00e9","family":"Berthiaume","sequence":"first","affiliation":[]},{"given":"Todd","family":"Bittner","sequence":"additional","affiliation":[]},{"given":"Ljubomir","family":"Perkovi\u0107","sequence":"additional","affiliation":[]},{"given":"Amber","family":"Settle","sequence":"additional","affiliation":[]},{"given":"Janos","family":"Simon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2004.01.036_BIB1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/S0019-9958(67)90032-0","article-title":"An 8-state minimal time solution to the firing squad synchronization problem","volume":"10","author":"Balzer","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/j.tcs.2004.01.036_BIB2","unstructured":"A. Berthiaume, L. Perkovi\u0107, A. Settle, J. Simon, New bounds for the firing squad problem on a ring, in: SIROCCO 9: Proc. of the ninth Internat. Coll. on Structural Information and Communication Complexity, Andros, Greece, Carleton Scientific, 2002, pp. 17\u201331."},{"key":"10.1016\/j.tcs.2004.01.036_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(89)90134-8","article-title":"Variations of the firing squad problem and applications","volume":"30","author":"Culik","year":"1989","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/j.tcs.2004.01.036_BIB4","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1006\/jagm.1996.0840","article-title":"Computing with snakes in directed networks of automata","volume":"24","author":"Even","year":"1997","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/j.tcs.2004.01.036_BIB5","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(78)90011-9","article-title":"The firing squad synchronization problem for a class of polyautomata networks","volume":"17","author":"Kobayashi","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2004.01.036_BIB6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(87)90124-1","article-title":"A six-state minimal time solution to the firing synchronization problem","volume":"50","author":"Mazoyer","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2004.01.036_BIB7","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0019-9958(68)90309-4","article-title":"A generalized firing squad problem","volume":"12","author":"Moore","year":"1968","journal-title":"Inform. and Control"},{"issue":"1","key":"10.1016\/j.tcs.2004.01.036_BIB8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(81)90004-9","article-title":"The firing squad synchronization problem for graphs","volume":"14","author":"Nishitani","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2004.01.036_BIB9","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, D. Wilkerson, Faster computation on directed networks of automata, in: Proc. of 14th Annu. ACM Symp. on Principles of Distributed Computing, Ottawa, Ontario, Canada, 1995, pp. 38\u201346.","DOI":"10.1145\/224964.224969"},{"key":"10.1016\/j.tcs.2004.01.036_BIB10","series-title":"Proceedings of the VI International Workshop on Parallel Processing by Cellular Automata and Arrays","first-page":"99","article-title":"Massively parallel search for transition-tables of polyautomata","author":"Sanders","year":"1994"},{"issue":"1","key":"10.1016\/j.tcs.2004.01.036_BIB11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0304-3975(01)00191-8","article-title":"Smaller solutions for the firing squad","volume":"276","author":"Settle","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2004.01.036_BIB12","unstructured":"T.A. Settle, New bounds for the distributed firing synchronization problem, Ph.D. Thesis, Department of Computer Science, University of Chicago, 1999."},{"key":"10.1016\/j.tcs.2004.01.036_BIB13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(82)90040-8","article-title":"Time-optimal solution of the firing-squad-synchronization-problem for n-dimensional rectangles with the general at an arbitrary position","volume":"19","author":"Szwerinski","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2004.01.036_BIB14","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0019-9958(66)90110-0","article-title":"An optimum solution to the firing squad synchronization problem","volume":"9","author":"Waksman","year":"1966","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750400088X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750400088X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T23:25:56Z","timestamp":1550186756000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750400088X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":14,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["S030439750400088X"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.tcs.2004.01.036","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,6]]}}}
