{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:31Z","timestamp":1725664711132},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602491"},{"type":"electronic","value":"9783540447702"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995]]},"DOI":"10.1007\/3-540-60249-6_59","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:57:35Z","timestamp":1330279055000},"page":"273-282","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Effective systolic algorithms for gossiping in cycles and two-dimensional grids"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Pardubsk\u00e1","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Unger","sequence":"additional","affiliation":[]},{"given":"Juraj","family":"Waczulik","sequence":"additional","affiliation":[]},{"given":"Hubert","family":"Wagener","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","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":"Letters"},{"key":"22_CR2","doi-asserted-by":"publisher","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":"22_CR3","doi-asserted-by":"publisher","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":"22_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":"22_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"},{"issue":"Nos.1\u20133","key":"22_CR6","first-page":"79","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"P. Fraigniaud, E. Lazard, Methods and problems of communication in usual networks. Discrete Applied Mathematics, special issue on Broad-casting and Gossiping (DAM-BG), Vol. 53 Nos. 1\u20133, September 1994, pp. 79\u2013134.","journal-title":"Discrete Applied Mathematics, special issue on Broad-casting and Gossiping (DAM-BG)"},{"key":"22_CR7","first-page":"161","volume":"5","author":"A.M. Farley","year":"1980","unstructured":"A.M. Farley, A. Proskurowski, Gossiping in grid graphs. J. Combin. Inform. System Sci. 5 (1980), pp. 161\u2013172.","journal-title":"J. Combin. Inform. System Sci."},{"issue":"No.2","key":"22_CR8","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0304-3975(94)90049-3","volume":"127","author":"J. Hromkovi\u010d","year":"1994","unstructured":"J. Hromkovi\u010d, C.-D. Jeschke, B. Monien: Note on Optimal Gossiping in some Weak-Connected Graphs. Theoretical Computer Science 127 (1994), No. 2, 395\u2013402.","journal-title":"Theoretical Computer Science"},{"key":"22_CR9","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":"22_CR10","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, 1994, to appear."},{"key":"22_CR11","unstructured":"J. Hromkovi\u010d, R. Klasing, D. Pardubsk\u00e1, W. Unger, H. Wagener: The complexity of systolic dissemination of information in interconnection networks. In: Proc. of the 1st Canada-France Conference on Parallel Computing (CFCP '94), Springer LNCS 805, pp. 235\u2013249. R.A.I.R.O. Theoretical Informatics and Applications, Vol. 28 Nos. 3\u20134, 1994, pp. 303\u2013342."},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0221010","volume":"21","author":"D.W. Krumme","year":"1992","unstructured":"D.W. Krumme, G. Cybenko, K.N. Venkataraman: Gossiping in minimal time. SIAM J. Comput. 21 (1992), pp. 111\u2013139.","journal-title":"SIAM J. Comput."},{"issue":"Nos.1\u20133","key":"22_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(94)90186-4","volume":"53","author":"G. Kortsarz","year":"1994","unstructured":"G. Kortsarz, D. Peleg: Traffic-light scheduling on the grid. Discrete Applied Mathematics, special issue on Broadcasting and Gossiping (DAM-BG), Vol. 53 Nos. 1\u20133, September 1994, pp. 211\u2013234.","journal-title":"Discrete Applied Mathematics, special issue on Broadcasting and Gossiping (DAM-BG)"},{"key":"22_CR14","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."},{"issue":"Nos.1\u20133","key":"22_CR15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0166-218X(94)90187-2","volume":"53","author":"R. Labahn","year":"1994","unstructured":"R. Labahn, S.T. Hedetniemi, R. Laskar, Periodic gossiping on trees. Discrete Applied Mathematics, special issue on Broadcasting and Gossiping (DAM-BG), Vol. 53 Nos. 1\u20133, September 1994, pp. 235\u2013246.","journal-title":"Discrete Applied Mathematics, special issue on Broadcasting and Gossiping (DAM-BG)"},{"key":"22_CR16","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."},{"issue":"No.4","key":"22_CR17","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1142\/S0129626493000381","volume":"3","author":"A.L. Liestman","year":"1993","unstructured":"A.L. Liestman, D. Richards: Perpetual gossiping. Parallel Processing Letters 3 (1993), No. 4, 347\u2013355.","journal-title":"Parallel Processing Letters"},{"key":"22_CR18","volume-title":"Technical Report","author":"R. Labahn","year":"1994","unstructured":"R. Labahn, A. Raspaud: Periodic gossiping in back-to-back trees. Technical Report, Universit\u00e4t Rostock, Germany, 1994."},{"key":"22_CR19","unstructured":"Cheng-Zhong Xu, Francis C.M. Lau: Distributed termination detection of loosely synchronized computations. In: Proc. 4th IEEE Symp. on Parallel and Distr. Processing, Texas 1992, pp. 196\u2013203."},{"key":"22_CR20","unstructured":"Cheng-Zhong Xu, Francis C.M. Lau: Efficient distributed termination detection for synchronous computations in multicomputers. Technical Report TR-94-04, Department of Computer Science, The University of Hong Kong, March 1994."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60249-6_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:57:00Z","timestamp":1687287420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60249-6_59"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602491","9783540447702"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60249-6_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}