{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:50Z","timestamp":1725664250221},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580782"},{"type":"electronic","value":"9783540484356"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","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":[[1994]]},"DOI":"10.1007\/3-540-58078-6_20","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:10:54Z","timestamp":1330269054000},"page":"235-249","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The complexity of systolic dissemination of information in interconnection networks"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Unger","sequence":"additional","affiliation":[]},{"given":"Hubert","family":"Wagener","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(90)90160-Y","volume":"34","author":"A. Bagchi","year":"1990","unstructured":"A. Bagchi, S. L. Hakimi, J. Mitchem, E. Schmeichel: Parallel algorithms for gossiping by mail. Information Process. Letters 34 (1990), 197\u2013202.","journal-title":"Information Process. Letters"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00264617","volume":"21","author":"C. Choffrut","year":"1984","unstructured":"C. Choffrut, K. Culik II: On real-time cellular automata and trellis automata. Acta Informatica 21 (1984), 393\u2013407.","journal-title":"Acta Informatica"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289573","volume":"18","author":"K. Culik II","year":"1983","unstructured":"K. Culik II, J. Gruska, A. Salomaa: Systolic automata for VLSI on balanced trees. Acta Informatica 18 (1983), 335\u2013344.","journal-title":"Acta Informatica"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/00207168408803410","volume":"15","author":"K. Culik II","year":"1984","unstructured":"K. Culik II, I. Gruska, A. Salomaa: Systolic trellis automata. Part I. Intern. J. Comput. Math. 15 (1984), 195\u2013212.","journal-title":"Intern. J. Comput. Math."},{"key":"20_CR5","first-page":"53","volume":"18","author":"K. Culik II","year":"1984","unstructured":"K. Culik II, A. Salomaa, D. Wood: Systolic tree acceptors. R.A.I.R.O. Theoretical Informatics 18 (1984), 53\u201369.","journal-title":"R.A.I.R.O. Theoretical Informatics"},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. M. Hedetniemi","year":"1988","unstructured":"S. M. Hedetniemi, S. T. Hedetniemi, A. L. Liestmann: A survey of gossiping and broadcasting in communication networks. Networks 18 (1988), 319\u2013349.","journal-title":"Networks"},{"key":"20_CR7","unstructured":"J. Hromkovi\u010d, C.-D. Jeschke, B. Monien: Note an optimal gossiping in some weak-connected graphs. Theoretical Computer Science, to appear."},{"key":"20_CR8","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien, R. Peine: Dissemination of information in interconnection networks (broadcasting & gossiping). In: Combinatorial Network Theory (Frank Hsu, Ding-Zhu Du, Eds.), Science Press, AMS 1993, to appear."},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(84)90015-X","volume":"29","author":"O. H. Ibarra","year":"1984","unstructured":"O. H. Ibarra, S. M. Kim: Characterizations and computational complexity of systolic trellis automata. Theoretical Computer Science 29 (1984), 123\u2013153.","journal-title":"Theoretical Computer Science"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1137\/0214033","volume":"14","author":"O. H. Ibarra","year":"1985","unstructured":"O. H. Ibarra, S. M. Kim, S. Moran: Sequential machine characterizations of trellis and cellular automata and applications. SIAM J. Comput. 14 (1985), 426\u2013447.","journal-title":"SIAM J. Comput."},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(85)90073-8","volume":"41","author":"O. H. Ibarra","year":"1985","unstructured":"O. H. Ibarra, M. A. Palis, S. M. Kim: Fast parallel language recognition by cellular automata. Theoretical Computer Science 41 (1985), 231\u2013246.","journal-title":"Theoretical Computer Science"},{"key":"20_CR12","unstructured":"H.T. Kung: Let's design algorithms for VLSI systems. In: Proc. of the Caltech Conference of VLSI (CL.L. Seifz Ed.), Pasadena, California 1979, pp. 65\u201390."},{"key":"20_CR13","unstructured":"R. Labahn, S.T. Hedetniemi, R. Laskar, Periodic gossiping on trees. to appear in: Discrete Applied Mathematics."},{"key":"20_CR14","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/71.219758","volume":"4","author":"A.L. Liestman","year":"1993","unstructured":"A.L. Liestman, D. Richards: Network communication in edge-colored graphs: Gossiping. IEEE Trans. Par. Distr. Syst. 4 (1993), 438\u2013445.","journal-title":"IEEE Trans. Par. Distr. Syst."},{"key":"20_CR15","volume-title":"Technical Report","author":"A.L. Liestman","year":"1993","unstructured":"A.L. Liestman, D. Richards: Perpetual gossiping. Technical Report, Simon Fraser University, Vancouver, Canada, 1993."},{"key":"20_CR16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-7091-9076-0_13","volume":"7","author":"B. Monien","year":"1990","unstructured":"B. Monien, I. H. Sudborough: Embedding one interconnection network in another. Computing Suppl. 7 (1990), 257\u2013282.","journal-title":"Computing Suppl."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing Theory and Practice"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58078-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:11:29Z","timestamp":1578528689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58078-6_20"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580782","9783540484356"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58078-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}