{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:09:48Z","timestamp":1725750588537},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_15","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"209-223","source":"Crossref","is-referenced-by-count":3,"title":["Faster Rumor Spreading: Breaking the logn Barrier"],"prefix":"10.1007","author":[{"given":"Chen","family":"Avin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Els\u00e4sser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Avin, C., Lotker, Z., Pignolet, Y.-A., Turkel, I.: From caesar to twitter: Structural properties of elites and rich-clubs. CoRR abs\/1111.3374 (2012)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Haeupler, B., Kelner, J., Maymounkov, P.: Global computation in a poorly connected world: Fast rumor spreading with no dependence on conductance. In: Proc.\u00a044th ACM Symposium on Theory of Computing, pp. 961\u2013970 (2012)","DOI":"10.1145\/2213977.2214064"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Chaintreau, A., Fraigniaud, P., Lebhar, E.: Opportunistic spatial gossip over mobile social networks. In: Proc.\u00a01st Workshop on Online Social Networks, pp. 73\u201378 (2008)","DOI":"10.1145\/1397735.1397752"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00012580","volume":"6","author":"F. Chung","year":"2002","unstructured":"Chung, F., Lu, L.: Connected components in random graphs with a given degree expected sequence. Annals of Combinatorics\u00a06, 125\u2013145 (2002)","journal-title":"Annals of Combinatorics"},{"issue":"6","key":"15_CR5","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":"15_CR6","doi-asserted-by":"crossref","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proc.\u00a06th Annual ACM Symposium on Principles of Distributed Computing, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: Proc.\u00a043rd Annual ACM Symposium on Theory of Computing, pp. 21\u201330 (2011)","DOI":"10.1145\/1993636.1993640"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading. In: Proc.\u00a019th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 773\u2013781 (2008)","DOI":"10.1145\/1963190.2025379"},{"issue":"4","key":"15_CR9","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 Struct. Algorithms\u00a01(4), 447\u2013460 (1990)","journal-title":"Random Struct. Algorithms"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in social networks. In: Proc.\u00a023rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1642\u20131660 (2012)","DOI":"10.1137\/1.9781611973099.130"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"A.M. Frieze","year":"1985","unstructured":"Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics\u00a010(1), 57\u201377 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR12","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: 28th International Symposium on Theoretical Aspects of Computer Science, pp. 57\u201368 (2011)"},{"issue":"8","key":"15_CR13","doi-asserted-by":"publisher","first-page":"3830","DOI":"10.1137\/090769752","volume":"39","author":"M. Gurevich","year":"2010","unstructured":"Gurevich, M., Keidar, I.: Correctness of gossip-based membership under message loss. SIAM Journal on Computing\u00a039(8), 3830\u20133859 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Haeupler, B.: Simple, fast and deterministic gossip and rumor spreading. In: Proc.\u00a024th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 705\u2013716 (2013)","DOI":"10.1137\/1.9781611973105.51"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Harchol-Balter, M., Leighton, T., Lewin, D.: Resource discovery in distributed networks. In: Proc.\u00a018th Annual ACM symposium on Principles of Distributed Computing, pp. 229\u2013237 (1999)","DOI":"10.1145\/301308.301362"},{"key":"15_CR16","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: Proc.\u00a041st Annual Symposium on Foundations of Computer Science, pp. 565\u2013574 (2000)"},{"key":"15_CR17","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 482\u2013491 (2003)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proc.\u00a09th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956755.956769"},{"key":"15_CR19","volume-title":"Introduction to parallel algorithms and architectures","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to parallel algorithms and architectures. Morgan Kaufmann, San Francisco (1992)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Mahlmann, P., Schindelhauer, C.: Distributed random digraph transformations for peer-to-peer networks. In: Proc.\u00a018th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 308\u2013317 (2006)","DOI":"10.1145\/1148109.1148162"},{"key":"15_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/0147013","volume":"47","author":"B. Pittel","year":"1987","unstructured":"Pittel, B.: On spreading a rumor. SIAM Journal on Applied Mathematics\u00a047(1), 213\u2013223 (1987)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-49543-6_13","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"M. Raab","year":"1998","unstructured":"Raab, M., Steger, A.: \u201cBalls into bins\u201d - A simple and tight analysis. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol.\u00a01518, pp. 159\u2013170. Springer, Heidelberg (1998)"},{"issue":"1","key":"15_CR24","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(1), 51\u201388 (2010)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T01:29:55Z","timestamp":1688520595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}