{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:38:51Z","timestamp":1725493131475},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003557"},{"type":"electronic","value":"9783540363859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36385-8_10","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T10:15:41Z","timestamp":1192875341000},"page":"98-107","source":"Crossref","is-referenced-by-count":0,"title":["4-Systolic Broadcasting in a Wrapped Butter.y Network"],"prefix":"10.1007","author":[{"given":"Ganesh","family":"Narayanaswamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil M.","family":"Shende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Praveen","family":"Vipranarayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1109\/71.219758","volume":"4","author":"A.L. Liestman","year":"1993","unstructured":"A.L. Liestman and D. Richards. Network communication in edge-colored graphs: gossiping. In IEEE Trans. Par. Distr. Syst., pages 4:438\u2013445. 1993.","journal-title":"IEEE Trans. Par. Distr. Syst."},{"key":"10_CR2","unstructured":"Flammini and Perennes. Lower bounds on systolic gossip. In IPPS: 11th International Parallel Processing Symposium. IEEE Computer Society Press, 1997."},{"key":"10_CR3","unstructured":"Michele Flammini and Stephane Perennes. Lower bounds on the broadcasting and gossiping time of restricted protocols. Technical Report RR-3612."},{"key":"10_CR4","unstructured":"Satoshi Fujita, Stephane Perennes, and Joseph G. Peters. Neighbourhood gossiping in hypercubes. Technical report, Simon Fraser University, 1997."},{"issue":"3\u20134","key":"10_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1051\/ita\/1994283-403031","volume":"28","author":"J. Hromkovic","year":"1994","unstructured":"J. Hromkovic, R. Klasing, D. Pardubska, W. Unger, and H. Wagener. The complexity of systolic dissemination of information in interconnection networks. In R.A.I.R.O. Theoretical Informatics and Applications, pages 28(3\u20134):303\u2013342. 1994.","journal-title":"R.A.I.R.O. Theoretical Informatics and Applications"},{"key":"10_CR6","unstructured":"Juran Hromkovic, Ralf Klasing, Burkhand Monien, and Regine Peine. Dissemination of information in interconnection networks (broadcasting and gossiping). in Combinatorial Network Theory."},{"key":"10_CR7","unstructured":"H.T. Kung. Let\u2019s design algorithms for VLSI systems. In Proc. of the Caltech Conference of VLSI (CL.L. Seifz Ed.), pages 65\u201390, Pasadena, California, 1979."},{"key":"10_CR8","unstructured":"Snehal Joshi and Praveen Vipranarayanan. Broadcasting in a wrapped butterfly network. In TechFiesta: PSG College of Technology, Coimbatore, 2001. see \n                    http:\/\/citeseer.nj.nec.com\/joshi01broadcasting.html\n                    \n                  ."},{"issue":"1\u20133","key":"10_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0166-218X(94)90184-8","volume":"53","author":"R. Klasing","year":"1994","unstructured":"R. Klasing, B. Monien, R. Peine, and E. Stohr. Broadcasting in butterfly and deBruijn networks. In Discrete Applied Mathematics, pages 53(1\u20133):183\u2013197. 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-61626-8_42","volume-title":"Lower bounds on broadcasting time of deBruijn networks","author":"S. Perennes","year":"1996","unstructured":"S. Perennes. Lower bounds on broadcasting time of deBruijn networks. In 2nd Int. Euro-Par Conference, volume 1123 ofLecture notes in computer Science, pages 325\u2013332. Springer-Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36385-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T08:10:36Z","timestamp":1550995836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36385-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003557","9783540363859"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-36385-8_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}