{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T22:34:13Z","timestamp":1725834853297},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319252575"},{"type":"electronic","value":"9783319252582"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25258-2_19","type":"book-chapter","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T03:10:18Z","timestamp":1445224218000},"page":"270-284","source":"Crossref","is-referenced-by-count":2,"title":["On Fast and Robust Information Spreading in the Vertex-Congest Model"],"prefix":"10.1007","author":[{"given":"Keren","family":"Censor-Hillel","sequence":"first","affiliation":[]},{"given":"Tariq","family":"Toukan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y., Yeung, R.W.: Network information flow. IEEE Transactions on Information Theory\u00a046(4), 1204\u20131216 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Ghaffari, M., Kuhn, F.: Distributed connectivity decomposition. In: Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing, PODC, pp. 156\u2013165 (2014)","DOI":"10.1145\/2611462.2611491"},{"key":"19_CR3","unstructured":"Censor-Hillel, K., Ghaffari, M., Kuhn, F.: A new perspective on vertex connectivity. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 546\u2013561 (2014). \n \n http:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611973402.41"},{"key":"19_CR4","unstructured":"Censor-Hillel, K., Giakkoupis, G.: Fast and robust information spreading (2012) (unpublished manuscript)"},{"key":"19_CR5","unstructured":"Censor-Hillel, K., Toukan, T.: On fast and robust information spreading in the vertex-congest model (2015). \n \n http:\/\/arxiv.org\/abs\/1507.01181"},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"2486","DOI":"10.1109\/TIT.2006.874532","volume":"52","author":"S. Deb","year":"2006","unstructured":"Deb, S., M\u00e9dard, M., Choute, C.: Algebraic gossip: A network coding approach to optimal multiple rumor mongering. IEEE Transactions on Information Theory\u00a052(6), 2486\u20132507 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR7","unstructured":"Els\u00e4sser, R., Sauerwald, T.: Cover time and broadcast time. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS, pp. 373\u2013384 (2009)"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"1","author":"U. Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Structures & Algorithms\u00a01(4), 447\u2013460 (1990)","journal-title":"Random Structures & Algorithms"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Haeupler, B.: Analyzing network coding gossip made easy. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC, pp. 293\u2013302 (2011)","DOI":"10.1145\/1993636.1993676"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Ho, T., Koetter, R., Medard, M., Karger, D.R., Effros, M.: The benefits of coding over routing in a randomized setting. In: Proceedings of the IEEE International Symposium on Information Theory, p. 442 (2003)","DOI":"10.1109\/ISIT.2003.1228459"},{"issue":"10","key":"19_CR11","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T. Ho","year":"2006","unstructured":"Ho, T., M\u00e9dard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., Leong, B.: A random linear network coding approach to multicast. IEEE Transactions on Information Theory\u00a052(10), 4413\u20134430 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Newport, C.: The abstract MAC layer. Distributed Computing\u00a024(3-4), 187\u2013206 (2011). \n \n http:\/\/dx.doi.org\/10.1007\/s00446-010-0118-0","DOI":"10.1007\/s00446-010-0118-0"},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S.Y. Li","year":"2003","unstructured":"Li, S.Y., Yeung, R.W., Cai, N.: Linear network coding. IEEE Transactions on Information Theory\u00a049(2), 371\u2013381 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"19_CR14","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K. Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen kurventheorie. Fundamenta Mathematicae\u00a010(1), 96\u2013115 (1927)","journal-title":"Fundamenta Mathematicae"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511813603"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Mosk-Aoyama, D., Shah, D.: Information dissemination via network coding. In: 2006 IEEE International Symposium on Information Theory, pp. 1748\u20131752. IEEE (2006)","DOI":"10.1109\/ISIT.2006.261654"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)","DOI":"10.1137\/1.9780898719772"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25258-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T03:52:54Z","timestamp":1559274774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25258-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252575","9783319252582"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25258-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}