{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:17Z","timestamp":1725664757353},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614227"},{"type":"electronic","value":"9783540685296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_135","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:37:05Z","timestamp":1330292225000},"page":"234-245","source":"Crossref","is-referenced-by-count":0,"title":["Communication complexity of gossiping by packets"],"prefix":"10.1007","author":[{"given":"Luisa","family":"Gargano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/S0097539790192672","volume":"23","author":"A. Bagchi","year":"1994","unstructured":"A. Bagchi, E.F. Schmeichel, and S.L. Hakimi, \u201cParallel Information Dissemination by Packets\u201d, SIAM J. on Computing, 23 (1994), 355\u2013372.","journal-title":"SIAM J. on Computing"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/net.3230220402","volume":"22","author":"A. Bagchi","year":"1992","unstructured":"A. Bagchi, E.F. Schmeichel, and S.L. Hakimi, \u201cSequential Information Dissemination by Packets\u201d, NETWORKS, 22 (1992), 317\u2013333.","journal-title":"NETWORKS"},{"key":"#cr-split#-21_CR3.1","unstructured":"J.-C. Bermond, L. Gargano, A. Rescigno, and U. Vaccaro, \u201cFast Gossiping by Short Messages\u201d, SIAM J. on Computing, to appear;"},{"key":"#cr-split#-21_CR3.2","unstructured":"an extended abstract appeared in: Proceedings of ICALP '95, Z. F\u00fcl\u00f6p and F. G\u00e9cseg (Eds.), Lectures Notes in Computer Science, vol. 944, pp. 135\u2013146, Springer-Verlag, 1995."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"J.-C. Bermond, S. Perennes, and T. Kodate, \u201cGossiping in Cayley Graphs by Packets\u201d, in: Proceedings of the 8-th French-Japanese Conference on Combinatorics and Computer Science, Brest, July 1995.","DOI":"10.1007\/3-540-61576-8_91"},{"key":"21_CR5","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D. P. Bertsekas","year":"1989","unstructured":"D. P. Bertsekas, and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"K. Diks, A. Pelc, \u201cEfficient Gossiping by Packets in Networks with Random Faults\u201d, SIAM J. Discrete Mathematics, 9 (1996).","DOI":"10.1137\/0409002"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"S. Even and B. Monien, \u201cOn the number of Rounds Necessary to Disseminate Information\u201d, Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, Santa Fe, NM (1989), 318\u2013327.","DOI":"10.1145\/72935.72969"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraignaud","year":"1994","unstructured":"P. Fraignaud, E. Lazard, \u201cMethods and Problems of Communication in Usual Networks\u201d, Discrete Applied Math., 53 (1994), 79\u2013134.","journal-title":"Discrete Applied Math."},{"key":"21_CR9","first-page":"41","volume":"36-6","author":"S. Fujita","year":"1993","unstructured":"S. Fujita, \u201cGossiping in Mesh-Bus Computers by Packets with Bounded Length\u201d, IPS Japan SIGAL, 36-6 (1993), 41\u201348.","journal-title":"IPS Japan SIGAL"},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/net.3230220505","volume":"22","author":"L. Gargano","year":"1992","unstructured":"L. Gargano, \u201cTighter Time Bounds on Fault-Tolerant Broadcasting and Gossiping\u201d, NETWORKS, 22 (1992), 469\u2013486.","journal-title":"NETWORKS"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"L. Gargano and A. A. Rescigno, \u201cCommunication Complexity of Fault-Tolerant Information Diffusion\u201d, Proceeding of the 5th IEEE Symposium on Parallel and Distributed Computing (SPDP 93), Dallas, TX, 564\u2013571, 1993.","DOI":"10.1109\/SPDP.1993.395484"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1137\/0608036","volume":"8","author":"R.W. Haddad","year":"1987","unstructured":"R.W. Haddad, S. Roy, and A. A. Sch\u00e4ffer, \u201cOn Gossiping with Faulty Telephone Lines\u201d, SIAM J. on Alg. Discr. Meth., 8 (1987), 439\u2013445.","journal-title":"SIAM J. on Alg. Discr. Meth."},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. Hedetniemi","year":"1988","unstructured":"S. Hedetniemi, S. Hedetniemi, and A. Liestman, \u201cA Survey of Gossiping and Broadcasting in Communication Networks\u201d, NETWORKS, 18 (1988), 129\u2013134.","journal-title":"NETWORKS"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"A. Hily and D. Sotteau, \u201cCommunications in Bus Networks\u201d, in: Parallel and Distributed Computing, M. Cosnard, A. Ferreira, and J. Peters (Eds.), Lectures Notes in Computer Science, 805, Springer-Verlag, (1994), 197\u2013206.","DOI":"10.1007\/3-540-58078-6_17"},{"key":"21_CR15","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien, and R. Peine, \u201cDissemination of Information in Interconnection Networks (Broadcasting and Gossiping)\u201d, in: F. Hsu, D.-Z. Du (Eds.) Combinatorial Network Theory, Kluwer Academic Publishers, (1995) 125\u2013212."},{"key":"21_CR16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(80)90116-8","volume":"30","author":"W. Kn\u00f6del","year":"1980","unstructured":"W. Kn\u00f6del, \u201cNew Gossips and Telephons\u201d, Discrete Math., 30 (1980), 151\u2013156.","journal-title":"Discrete Math."},{"key":"21_CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0221010","volume":"21","author":"D. W. Krumme","year":"1992","unstructured":"D. W. Krumme, K.N. Venkataraman, and G. Cybenko, \u201cGossiping in Minimal Time\u201d, SIAM J. on Computing, 21 (1992), 111\u2013139.","journal-title":"SIAM J. on Computing"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"A. Pelc, \u201cFault Tolerant Broadcasting and Gossiping in Communication Networks\u201d, Technical Report (1995), University of Quebec.","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"R. Ravi, \u201cRapid Rumour Ramification: Approximating the Minimum Broadcasting Time\u201d, Proc. 35th Annual Symposium on Foundations of Computer Science (FOCS '94), (1994), 202\u2013213.","DOI":"10.1109\/SFCS.1994.365693"},{"key":"21_CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0743-7315(90)90026-L","volume":"10","author":"Q. Stout","year":"1990","unstructured":"Q. Stout and B. Wagar, \u201cIntensive Hypercube Communication\u201d, J. Parallel and Distr. Computing, 10 (1990), 167\u2013181.","journal-title":"J. Parallel and Distr. Computing"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0220027","volume":"20","author":"O. Wolfson","year":"1991","unstructured":"O. Wolfson and A. Segall, \u201cThe Communication Complexity of Atomic Commitment and of Gossiping\u201d, SIAM J. on Computing, 20 (1991), 423\u2013450.","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_135.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T19:11:00Z","timestamp":1687288260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_135","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}