{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:50Z","timestamp":1725497270383},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_23","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"244-255","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of the \u201cMost General\u201d Undirected Firing Squad Synchronization Problem"],"prefix":"10.1007","author":[{"given":"Darin","family":"Goldstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kojiro","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1137\/S0097539705447086","volume":"35","author":"D. Goldstein","year":"2005","unstructured":"Goldstein, D., Kobayashi, K.: On the complexity of network synchronization. SIAM J. Comput.\u00a035(3), 567\u2013589 (2005)","journal-title":"SIAM J. Comput."},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/11672142_57","volume-title":"STACS 2006","author":"D. Goldstein","year":"2006","unstructured":"Goldstein, D., Kobayashi, K.: On the complexity of the \u201dmost general\u201d firing squad synchronization problem. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 696\u2013711. Springer, Heidelberg (2006)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(99)00332-1","volume":"259","author":"K. Kobayashi","year":"2001","unstructured":"Kobayashi, K.: On time optimal solutions of the firing squad synchronization problem for two-dimensional paths. Theoretical Computer Science\u00a0259, 129\u2013143 (2001)","journal-title":"Theoretical Computer Science"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","first-page":"12","volume-title":"Automata Networks","author":"J. Mazoyer","year":"1988","unstructured":"Mazoyer, J.: An overview of the firing synchronization problem. In: Choffrut, C. (ed.) Automata Networks. LNCS, vol.\u00a0316, pp. 12\u201316. Springer, Heidelberg (1988)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:01:07Z","timestamp":1619521267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_23","relation":{},"subject":[]}}