{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:20Z","timestamp":1742617220613,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616269"},{"type":"electronic","value":"9783540706335"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996]]},"DOI":"10.1007\/3-540-61626-8_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:05:44Z","timestamp":1330293944000},"page":"353-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A gossip algorithm for bus networks with buses of limited length"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]},{"given":"Christian","family":"Laforest","sequence":"additional","affiliation":[]},{"given":"Stephane","family":"Perennes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"J.-C. Bermond, J. Bond, and S. Djelloul. Dense bus networks of Diameter 2. In Interconnection Networks and Mapping and Scheduling Parallel Computation, DI-MACS Workshop, Volume 21, D. F. Hsu, A. L. Rosenberg, D. Sotteau Editors, American Mathematical Society (1994) 9\u201318.","DOI":"10.1090\/dimacs\/021\/02"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"J-C. Bermond and F.O. Ergincan. Bus Interconnection Networks. To appear in Discrete Applied Mathematics (1996).","DOI":"10.1016\/0166-218X(95)00046-T"},{"issue":"1","key":"46_CR3","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1137\/0405002","volume":"5","author":"J.-C. Bermond","year":"1992","unstructured":"J.-C. Bermond, P. Hell, A. L. Liestman, and J. G. Peters. Broadcasting in Bounded Degree Graphs. SIAM J. Disc. Math. 5(1) (1992) 10\u201324.","journal-title":"SIAM J. Disc. Math."},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0016-0032(79)90004-8","volume":"307","author":"R. C. Entringer","year":"1979","unstructured":"R. C. Entringer and P. J. Slater. Gossips and telegraphs. J. Franklin Inst. 307 (1979) 353\u2013360.","journal-title":"J. Franklin Inst."},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"S. Even and B. Monien. On the number of rounds necessary to disseminate information. In Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, (1989) 318\u2013327.","DOI":"10.1145\/72935.72969"},{"key":"46_CR6","unstructured":"A. Ferreira, A. Goldman vel Lejbman, and S. Song. Bus based parallel computers: a viable way for massive parallelism. PARLE'94 (Lecture Notes in Computer Science 817), Springer Verlag (1994) 553\u2013564."},{"key":"46_CR7","unstructured":"A. Ferreira, A. Goldman Vel Lejbman, and S.W. Song. Broadcasting in bus interconnection networks. In Proc. Parallel Processing: CONPAR 94 \u2014 VAPP VI (Lecture Notes in Computer Science 854). Springer Verlag (1994) 797\u2013807."},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<239::AID-NET8>3.0.CO;2-J","volume":"27","author":"P. Fraigniaud","year":"1996","unstructured":"P. Fraigniaud and C. Laforest. Minimum gossip bus networks. Networks, 27 (1996) 239\u2013251.","journal-title":"Networks"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"P. Fraigniaud and E. Lazard. Methods and Problems of Communication in Usual Networks. Discrete Applied Mathematics 53 (1994) 79\u2013133.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"46_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1142\/S0129626493000393","volume":"3","author":"S. Fujita","year":"1993","unstructured":"S. Fujita and M. Yamashita. Optimal gossiping in mesh-bus computers. Parallel Processing Letters 3(4) (1993) 357\u2013361.","journal-title":"Parallel Processing Letters"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"S. Fujita, M. Yamashita, and T. Ae. Gossiping on mesh-bus computers by packets. In Proc. of Int'l Symp. on Parallel Architectures, Algorithms and Networks (ISPAN) (1994) 222\u2013229.","DOI":"10.1109\/ISPAN.1994.367143"},{"key":"46_CR12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. M. Hedetniemi","year":"1986","unstructured":"S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks 18 (1986) 319\u2013349.","journal-title":"Networks"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"A. Hily and D. Sotteau. Communication in bus networks. Parallel and Distributed Computing, (Lecture Notes in Computer Science 805). Springer Verlag (1994) 197\u2013206.","DOI":"10.1007\/3-540-58078-6_17"},{"issue":"1","key":"46_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1142\/S012962649600011X","volume":"6","author":"A. Hily","year":"1996","unstructured":"A. Hily and D. Sotteau. Gossiping in d-dimensional mesh-bus networks. Parallel Processing Letters 6(1) (1996) 101\u2013113.","journal-title":"Parallel Processing Letters"},{"key":"46_CR15","unstructured":"D. E. Knuth. The Art of Computer Programming, Vol.3\/Sorting and Searching, Addison-Wesley Publishing Company (1973)."},{"issue":"1","key":"46_CR16","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, and K. N. Venkataraman. Gossiping in minimal time. SIAM J. Comput., 21(1) (1992) 111\u2013139.","journal-title":"SIAM J. Comput."},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"R. Labahn and I. Warnke. Quick gossiping by multi-telegraphs. In Bodendiek and R. Henn, editors, Topics in Combinatorics and Graph Theory Phisica-Verlag Heidelberg (1990) 451\u2013458.","DOI":"10.1007\/978-3-642-46908-4_52"},{"key":"46_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(93)90180-V","volume":"42","author":"V. S. Sunderam","year":"1993","unstructured":"V. S. Sunderam and P. Winkler. Fast information sharing in a complete network. Discrete Applied Math. 42 (1993) 75\u201386.","journal-title":"Discrete Applied Math."}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61626-8_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:22:49Z","timestamp":1742599369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61626-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616269","9783540706335"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61626-8_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}