{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:12Z","timestamp":1742596812011,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_258","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:09:36Z","timestamp":1330261776000},"page":"277-286","source":"Crossref","is-referenced-by-count":0,"title":["Optimal group gossiping in hypercubes under wormhole routing model"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]},{"given":"Masafumi","family":"Yamashita","sequence":"additional","affiliation":[]},{"given":"Tadashi","family":"Ae","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"30_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, and E. Schmeichel. Parallel algorithms for gossiping by mail. Inform. Process. Lett., 34:197\u2013202, April 1990.","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"30_CR2","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","volume":"36","author":"W. J. Dally","year":"1987","unstructured":"W. J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection network. IEEE Trans. Comput., 36(5):547\u2013553, May 1987.","journal-title":"IEEE Trans. Comput."},{"key":"30_CR3","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:353\u2013360, 1979.","journal-title":"J. Franklin Inst."},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230100106","volume":"10","author":"A. M. Farley","year":"1980","unstructured":"A. M. Farley. Minimum-time line broadcast networks. Networks, 10:59\u201370, 1980.","journal-title":"Networks"},{"doi-asserted-by":"crossref","unstructured":"C. J. Glass and L. M. Ni. Adaptive routing in mesh-connected networks. In Proc. ICDC '92, pages 12\u201319. IEEE, 1992.","key":"30_CR5","DOI":"10.1109\/ICDCS.1992.235060"},{"key":"30_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, and A. L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319\u2013349, 1988.","journal-title":"Networks"},{"issue":"2","key":"30_CR7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/0221026","volume":"21","author":"D. W. Krumme","year":"1992","unstructured":"D. W. Krumme. Fast gossiping for the hypercube. SIAM J. Comput, 21(2):365\u2013380, April 1992.","journal-title":"SIAM J. Comput"},{"issue":"1","key":"30_CR8","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):111\u2013139, February 1992.","journal-title":"SIAM J. Comput"},{"key":"30_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0020-0190(90)90017-R","volume":"34","author":"A. Sengupta","year":"1990","unstructured":"A. Sengupta and S. Bandyopadhayay. Deadlock-free routing in k-ary hypercube network in presence of processor failures. Inform. Process. Lett., 34:323\u2013328, May 1990.","journal-title":"Inform. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"A. Trew and G. Wilson, editors. Past, Present, Parallel: A Survey of Available Parallel Computer Systems, chapter 4, pages 125\u2013147. Springer-Verlag, 1991.","key":"30_CR10","DOI":"10.1007\/978-1-4471-1842-8_4"},{"doi-asserted-by":"crossref","unstructured":"H. Xu, P. K. McKinley, and L. M. Ni. Efficient implementation of barrier sychronization in wormhole-routed hypercube multicomputers. In Proc. ICDC '92, pages 118\u2013125. IEEE, 1992.","key":"30_CR11","DOI":"10.1109\/ICDCS.1992.235048"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_258.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:11:24Z","timestamp":1742595084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_258","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}