{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:31Z","timestamp":1725493531730},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_64","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"785-796","source":"Crossref","is-referenced-by-count":0,"title":["Faster Gossiping on Butterflies"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"issue":"1","key":"64_CR1","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/S0097539791197852","volume":"23","author":"J.-C. Bermond","year":"1994","unstructured":"Bermond, J.-C., P. Fraigniaud, \u2018Broadcasting and Gossiping in de Bruijn Networks,\u2019 SIAM Journal on Computing, 23(1), pp. 212\u2013225, 1994.","journal-title":"SIAM Journal on Computing"},{"key":"64_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/3-540-61626-8_48","volume-title":"Proc. 2nd Euro-Par Conference","author":"O. Delmas","year":"1996","unstructured":"Delmas, O., S. Perennes, \u2018Circuit-Switched Gossiping in 3-Dimensional Torus Networks,\u2019 Proc. 2nd Euro-Par Conference, LNCS 1123, pp. 370\u2013373, Springer-Verlag, 1996."},{"key":"64_CR3","first-page":"137","volume":"5","author":"G. Fertin","year":"1999","unstructured":"Fertin, G., \u2018Trade-Offs for Odd Gossiping,\u2019 Proc. 6th Colloquium on Structural Information \u2130 Communication Complexity, Proceedings in Informatics 5, pp. 137\u2013151, Carleton Scientific, 1999.","journal-title":"Proceedings in Informatics"},{"key":"64_CR4","unstructured":"Fraigniaud, P., J.G. Peters, \u2018Minimum Linear Gossip Graphs and Maximal Linear (\u0394 k)-Gossip Graphs,\u2019 Techn. Rep. CMPT TR 94-06, Simon Fraser University, Burnaby, B.C., 1994. Available at http:\/\/www.fas.sfu.ca\/pub\/cs\/techreports\/1994\/ ."},{"issue":"1","key":"64_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jpdc.1997.1318","volume":"43","author":"P. Fraigniaud","year":"1997","unstructured":"Fraigniaud, P., S. Vial, \u2018Approximation Algorithms for Broadcasting and Gossiping,\u2019 Journal of Parallel and Distributed Computing, 43(1), pp. 47\u201355, 1997.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"64_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1142\/S0129626499000049","volume":"9","author":"P. Fraigniaud","year":"1999","unstructured":"Fraigniaud, P., S. Vial, \u2018Comparison of Heuristics for One-to-All and All-to-All Communication in Partial Meshes,\u2019 Parallel Processing Letters, 9(1), pp. 9\u201320, 1999.","journal-title":"Parallel Processing Letters"},{"key":"64_CR7","first-page":"166","volume":"5","author":"P. Gvozdjak","year":"1999","unstructured":"Gvozdjak, P., J.G. Peters, \u2018Gossiping in Inclined LEO Satellite Networks,\u2019 Proc. 6th Colloquium on Structural Information and Communication Complexity, Proceedings in Informatics 5, pp. 166\u2013180, Carleton Scientific, 1999.","journal-title":"Proceedings in Informatics"},{"key":"64_CR8","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J., R. Klasing, B. Monien, R. Peine, \u2018Dissemination of Information in Interconnection Networks,\u2019 Combinatorial Network Theory, D.-Z. Du, D.F. Hsu (eds.), pp. 125\u2013212, Kluwer Academic Publishers, 1996.","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"64_CR9","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/PL00009164","volume":"18","author":"M. Kaufmann","year":"1997","unstructured":"M. Kaufmann, R. Raman, J.F. Sibeyn, \u2018Randomized Routing on Meshes with Buses,\u2019 Algorithmica, 18, pp. 417\u2013444, 1997.","journal-title":"Algorithmica"},{"key":"64_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/0012-365X(94)90290-9","volume":"126","author":"R. Labahn","year":"1994","unstructured":"Labahn, R., I. Warnke, \u2018Quick Gossiping by Telegraphs,\u2019 Discrete Mathematics, 126, pp. 421\u2013424, North-Holland, 1994.","journal-title":"Discrete Mathematics"},{"key":"64_CR11","first-page":"17","volume":"7","author":"R. Beier","year":"2000","unstructured":"Beier, R., J.F. Sibeyn, \u2018A Powerful Heuristic for Telephone Gossiping,\u2019 Proc. 7th Colloquium on Structural Information and Communication Complexity, pp. 17\u201335, Proceedings in Informatics 7, Carleton Scientific, 2000.","journal-title":"Proceedings in Informatics"},{"key":"64_CR12","doi-asserted-by":"crossref","unstructured":"Scheuermann, P., G. Wu, \u2018Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks,\u2019 IEEE Transactions on Computers, C-33(9), 1984.","DOI":"10.1109\/TC.1984.1676496"},{"key":"64_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/BFb0002738","volume-title":"Proc. 3rd International Euro-Par Conference","author":"M. \u0160och","year":"1997","unstructured":"\u0160och, M., P. Tvrd\u00edk, \u2018Optimal Gossip in Store-and-Forward Noncombining 2-D Tori,\u2019 Proc. 3rd International Euro-Par Conference, LNCS 1300, pp. 234\u2013241, Springer-Verlag, 1997."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:27:58Z","timestamp":1556922478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_64","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}