{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:57:17Z","timestamp":1725544637092},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_57","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"696-711","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of the \u201cMost General\u201d 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":[{"key":"57_CR1","unstructured":"Aingworth, Chekuri, Motwani.: Fast estimation of diameter and shortest paths (without matrix multiplication). In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) (1996)"},{"key":"57_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/S0019-9958(67)90032-0","volume":"10","author":"R. Balzer","year":"1967","unstructured":"Balzer, R.: An 8-state minimal time solution to the firing squad synchronization problem. Information and Control\u00a010, 22\u201342 (1967)","journal-title":"Information and Control"},{"key":"57_CR3","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2004.01.036","volume":"320","author":"A. Berthiaume","year":"2004","unstructured":"Berthiaume, A., Bittner, T., Perkovi\u0107, L., Settle, A., Simon, J.: Bounding the firing synchronization problem on a ring. Theoretical Computer Science\u00a0320, 213\u2013228 (2004)","journal-title":"Theoretical Computer Science"},{"key":"57_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09, 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"57_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press\/McGraw-Hill (1990)"},{"key":"57_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(89)90134-8","volume":"30","author":"K. Culik","year":"1989","unstructured":"Culik, K.: Variations of the firing squad problem and applications. Information Processing Letters\u00a030, 153\u2013157 (1989)","journal-title":"Information Processing Letters"},{"issue":"1","key":"57_CR7","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1006\/jagm.1996.0840","volume":"24","author":"S. Even","year":"1997","unstructured":"Even, S., Litman, A., Winkler, P.: Computing with snakes in directed networks of automata. J. Algorithms\u00a024(1), 158\u2013170 (1997)","journal-title":"J. Algorithms"},{"key":"57_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/0205006","volume":"5","author":"M.L. Fredman","year":"1976","unstructured":"Fredman, M.L.: New bounds on the complexity of the shortest path problem. SIAM J. of Computing\u00a05, 83\u201389 (1976)","journal-title":"SIAM J. of Computing"},{"key":"57_CR9","unstructured":"Goldstein, D., Kobayashi, K.: On the complexity of network synchronization. SIAM J. of Computing (to appear)"},{"key":"57_CR10","series-title":"Lecture Notes in Computer Science","first-page":"289","volume-title":"Algorithms and Computation","author":"D. Goldstein","year":"2004","unstructured":"Goldstein, D., Kobayashi, K.: On the complexity of network synchronization. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341,5(3), pp. 289\u2013308. Springer, Heidelberg (2004)"},{"key":"57_CR11","unstructured":"Goto, E.: A minimal time solution of the firing squad problem. Course Notes for Applied Mathematics 298, Harvard University, pp. 52\u201359 (1962)"},{"key":"57_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0019-9958(75)90255-7","volume":"28","author":"A. Grasselli","year":"1975","unstructured":"Grasselli, A.: Synchronization of cellular arrays: The firing squad problem in two dimensions. Information and Control\u00a028, 113\u2013124 (1975)","journal-title":"Information and Control"},{"key":"57_CR13","doi-asserted-by":"crossref","unstructured":"Jiang, T.: The synchronization of nonuniform networks of finite automata. In: Proc. of the 30th Annual ACM Symp. on Foundations of Computer Science, pp. 376\u2013381 (1989)","DOI":"10.1109\/SFCS.1989.63506"},{"key":"57_CR14","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/0890-5401(92)90036-F","volume":"97","author":"T. Jiang","year":"1992","unstructured":"Jiang, T.: The synchronization of nonuniform networks of finite automata. Information and Computation\u00a097, 234\u2013261 (1992)","journal-title":"Information and Computation"},{"key":"57_CR15","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Koller, D., Phillips, S.J.: Finding the hidden path: Time bounds for all-pairs shortest paths. In: IEEE Symposium on Foundations of Computer Science, pp. 560\u2013568 (1991)","DOI":"10.1109\/SFCS.1991.185419"},{"issue":"3","key":"57_CR16","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(78)90011-9","volume":"17","author":"K. Kobayashi","year":"1978","unstructured":"Kobayashi, K.: The firing squad synchronization problem for a class of polyautomata networks. J. Comput. System Sci.\u00a017(3), 300\u2013318 (1978)","journal-title":"J. Comput. System Sci."},{"key":"57_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(78)90046-4","volume":"7","author":"K. Kobayashi","year":"1978","unstructured":"Kobayashi, K.: On the minimal firing time of the firing squad synchronization problem for polyautomata networks. Theoretical Computer Science\u00a07, 149\u2013167 (1978)","journal-title":"Theoretical Computer Science"},{"key":"57_CR18","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":"57_CR19","first-page":"239","volume":"10","author":"S. LaTorre","year":"1996","unstructured":"LaTorre, S., Napoli, M., Parente, M.: Synchronization of one-way connected processors. Complex Systems\u00a010, 239\u2013255 (1996)","journal-title":"Complex Systems"},{"key":"57_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-19444-4_16","volume-title":"Automata Networks","author":"J. Mazoyer","year":"1988","unstructured":"Mazoyer, J.: An overview of the firing synchronization problem. In: Choffrut, C. (ed.) LITP 1986. LNCS, vol.\u00a0316, Springer, Heidelberg (1988)"},{"issue":"3","key":"57_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1142\/S0218196795000173","volume":"5","author":"J. Mazoyer","year":"1995","unstructured":"Mazoyer, J.: Synchronization of two interacting finite automata. International Journal of Algebra and Computation\u00a05(3), 289\u2013308 (1995)","journal-title":"International Journal of Algebra and Computation"},{"key":"57_CR22","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"57_CR23","volume-title":"Sequential Machines, Selected Papers","author":"E.F. Moore","year":"1962","unstructured":"Moore, E.F.: Sequential Machines, Selected Papers. Addison Wesley, Reading (1962)"},{"key":"57_CR24","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/S0019-9958(68)90309-4","volume":"12","author":"F.R. Moore","year":"1968","unstructured":"Moore, F.R., Langdon, G.G.: A generalized firing squad problem. Information and Control\u00a012, 212\u2013220 (1968)","journal-title":"Information and Control"},{"issue":"1","key":"57_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0304-3975(81)90004-9","volume":"14","author":"Y. Nishitani","year":"1981","unstructured":"Nishitani, Y., Honda, N.: The firing squad synchronization problem for graphs. Theoretical Computer Science\u00a014(1), 39\u201361 (1981)","journal-title":"Theoretical Computer Science"},{"key":"57_CR26","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Wilkerson, D.: Faster computation on directed networks of automata. In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, August 2\u201323, 1995, pp. 38\u201346 (1995)","DOI":"10.1145\/224964.224969"},{"key":"57_CR27","doi-asserted-by":"crossref","unstructured":"Schmid, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional CA. In: 3rd IFIP International Conference on Theoretical Computer Science, pp. 111\u2013124 (2004)","DOI":"10.1007\/1-4020-8141-3_11"},{"key":"57_CR28","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0019-9958(74)80055-0","volume":"24","author":"I. Shinahr","year":"1974","unstructured":"Shinahr, I.: Two- and three-dimensional firing-squad synchronization problem. Information and Control\u00a024, 163\u2013180 (1974)","journal-title":"Information and Control"},{"key":"57_CR29","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0019-9958(66)90110-0","volume":"9","author":"A. Waksman","year":"1966","unstructured":"Waksman, A.: An optimum solution to the firing squad synchronization problem. Information and Control\u00a09, 66\u201378 (1966)","journal-title":"Information and Control"},{"key":"57_CR30","unstructured":"Zwick, U.: Exact and approximate distances in graphs"},{"key":"57_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/978-3-540-30551-4_78","volume-title":"Algorithms and Computation","author":"U. Zwick","year":"2004","unstructured":"Zwick, U.: A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 921\u2013932. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T11:10:33Z","timestamp":1548414633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11672142_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}