{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:03:55Z","timestamp":1725728635385},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392467"},{"type":"electronic","value":"9783642392474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39247-4_21","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T01:43:18Z","timestamp":1370310198000},"page":"245-256","source":"Crossref","is-referenced-by-count":1,"title":["Estimating Time Complexity of Rumor Spreading in Ad-Hoc Networks"],"prefix":"10.1007","author":[{"given":"Dariusz R.","family":"Kowalski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Thraves Caro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Avin, C., Borokhovich, M., Censor-Hillel, K., Lotker, Z.: Order optimal information spreading using algebraic gossip. In: Proceedings of PODC 2011, pp. 363\u2013372 (2011)","DOI":"10.1145\/1993806.1993883"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Haeupler, B., Kelner, J.A., Maymounkov, P.: Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance. In: Proceedings of STOC 2012, pp. 961\u2013970 (2012)","DOI":"10.1145\/2213977.2214064"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Shachnai, H.: Partial information spreading with application to distributed maximum coverage. In: Proceedings of PODC 2010, pp. 161\u2013170 (2010)","DOI":"10.1145\/1835698.1835739"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Shachnai, H.: Fast information spreading in graphs with large weak conductance. In: Proceedings of SODA 2011, pp. 440\u2013448 (2011)","DOI":"10.1137\/1.9781611973082.35"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: Proceedings of STOC 2010, pp. 399\u2013408 (2010)","DOI":"10.1137\/1.9781611973075.135"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumour spreading and graph conductance. In: Proceedings of SODA 2010, pp. 1657\u20131663 (2010)","DOI":"10.1137\/1.9781611973075.135"},{"issue":"24","key":"21_CR7","doi-asserted-by":"publisher","first-page":"2602","DOI":"10.1016\/j.tcs.2010.11.001","volume":"412","author":"F. Chierichetti","year":"2011","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumor spreading in social networks. Theor. Comput. Sci.\u00a0412(24), 2602\u20132610 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/43921.43922","volume":"22","author":"A. Demers","year":"1988","unstructured":"Demers, A., Greene, D., Houser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. SIGOPS Oper. Syst. Rev.\u00a022, 8\u201332 (1988)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-22012-8_40","volume-title":"Automata, Languages and Programming","author":"B. Doerr","year":"2011","unstructured":"Doerr, B., Fouz, M.: Asymptotically optimal randomized rumor spreading. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 502\u2013513. Springer, Heidelberg (2011)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: Proceedings of STOC 2011, pp. 21\u201330 (2011)","DOI":"10.1145\/1993636.1993640"},{"issue":"7","key":"21_CR11","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/TMC.2006.104","volume":"5","author":"S. Dolev","year":"2006","unstructured":"Dolev, S., Schiller, E., Welch, J.L.: Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mob. Comput.\u00a05(7), 893\u2013905 (2006)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R.: On the communication complexity of randomized broadcasting in random-like graphs. In: Proceedings of SPAA 2006, pp. 148\u2013157 (2006)","DOI":"10.1145\/1148109.1148135"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in social networks. In: Proceedings of SODA 2012, pp. 1642\u20131660 (2012)","DOI":"10.1137\/1.9781611973099.130"},{"key":"21_CR14","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proceedings of STACS 2011, pp. 57\u201368 (2011)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Sauerwald, T.: Rumor spreading and vertex expansion. In: Proceedings of SODA 2012, pp. 1623\u20131641 (2012)","DOI":"10.1137\/1.9781611973099.129"},{"key":"21_CR16","unstructured":"Hromkovic, J., Klasing, R., Pelc, A., Ruzicka, P., Unger, W.: Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series. Springer (2010)"},{"key":"21_CR17","unstructured":"Karp, R.M., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: Proceedings of FOCS 2000, pp. 565\u2013574 (2000)"},{"issue":"7","key":"21_CR18","doi-asserted-by":"publisher","first-page":"2997","DOI":"10.1109\/TIT.2008.924648","volume":"54","author":"D. Mosk-Aoyama","year":"2008","unstructured":"Mosk-Aoyama, D., Shah, D.: Fast distributed algorithms for computing separable functions. IEEE Transactions on Information Theory\u00a054(7), 2997\u20133007 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00453-008-9245-4","volume":"56","author":"T. Sauerwald","year":"2010","unstructured":"Sauerwald, T.: On mixing and edge expansion properties in randomized broadcasting. Algorithmica\u00a056, 51\u201388 (2010)","journal-title":"Algorithmica"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Sauerwald, T., Stauffer, A.: Rumor spreading and vertex expansion on regular graphs. In: Proceedings of SODA 2011, pp. 462\u2013475 (2011)","DOI":"10.1137\/1.9781611973082.37"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Sinclair, A.: Algorithms for random generation and counting - a Markov chain approach. Progress in theoretical computer science. Birkh\u00e4user (1993)","DOI":"10.1007\/978-1-4612-0323-0"}],"container-title":["Lecture Notes in Computer Science","Ad-hoc, Mobile, and Wireless Network"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39247-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:12:32Z","timestamp":1557767552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39247-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392467","9783642392474"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39247-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}