{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:19Z","timestamp":1750306999293,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T00:00:00Z","timestamp":1340582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,25]]},"DOI":"10.1145\/2312005.2312031","type":"proceedings-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T13:31:21Z","timestamp":1340803881000},"page":"140-149","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Discovery through gossip"],"prefix":"10.1145","author":[{"given":"Bernhard","family":"Haeupler","sequence":"first","affiliation":[{"name":"MIT, Boston, MA, USA"}]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[{"name":"NTU, Singapore, Singapore"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]},{"given":"Zhifeng","family":"Sun","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.09.015"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780626"},{"key":"e_1_3_2_1_3_1","volume-title":"Discrete Mathematics","author":"Alon N.","year":"2003","unstructured":"N. Alon . Problems and results in extremal combinatorics -- II . Discrete Mathematics , 2003 . N. Alon. Problems and results in extremal combinatorics -- II. Discrete Mathematics, 2003."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2008.0122"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835790"},{"key":"e_1_3_2_1_6_1","volume-title":"Handbook of Graphs and Networks","author":"Bornholdt S.","year":"2003","unstructured":"S. Bornholdt and H. Schuster (Editors). Handbook of Graphs and Networks . Wiley-VCH , 2003 . S. Bornholdt and H. Schuster (Editors). Handbook of Graphs and Networks. Wiley-VCH, 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"e_1_3_2_1_8_1","volume-title":"SODA","author":"Chakrabarti S.","year":"2005","unstructured":"S. Chakrabarti , A. Frieze , and J. Vera . The influence of search engines on preferential attachment . In SODA , 2005 . S. Chakrabarti, A. Frieze, and J. Vera. The influence of search engines on preferential attachment. In SODA, 2005."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810504"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806745"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509970"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_57"},{"key":"e_1_3_2_1_14_1","first-page":"773","volume-title":"SODA","author":"Doerr B.","year":"2008","unstructured":"B. Doerr , T. Friedrich , and T. Sauerwald . Quasi-random rumor spreading . In SODA , pages 773 -- 781 , 2008 . B. Doerr, T. Friedrich, and T. Sauerwald. Quasi-random rumor spreading. In SODA, pages 773--781, 2008."},{"key":"e_1_3_2_1_15_1","first-page":"57","volume-title":"STACS","year":"2011","unstructured":"Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance . In STACS , pages 57 -- 68 , 2011 . Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. In STACS, pages 57--68, 2011."},{"key":"e_1_3_2_1_16_1","unstructured":"B. Haeupler G. Pandurangan D. Peleg R. Rajaraman and Z. Sun. Discovery through Gossip arXiv:1202.2092v1 {cs.DC}  B. Haeupler G. Pandurangan D. Peleg R. Rajaraman and Z. Sun. Discovery through Gossip arXiv:1202.2092v1 {cs.DC}"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301362"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582741"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.03.013"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796561"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946317"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652161"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380796"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378592"},{"key":"e_1_3_2_1_25_1","first-page":"5","volume-title":"DISC","author":"Law C.","year":"2000","unstructured":"C. Law and K. Siu . An O(log n) randomized resource discovery algorithm . In DISC , pages 5 -- 8 , 2000 . Brief Announcement. C. Law and K. Siu. An O(log n) randomized resource discovery algorithm. In DISC, pages 5--8, 2000. Brief Announcement."},{"key":"e_1_3_2_1_26_1","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher M.","year":"2004","unstructured":"M. Mitzenmacher and E. Upfal . Probability and Computing: Randomized Algorithms and Probabilistic Analysis . Cambridge University Press , 2004 . M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2004."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146401"},{"key":"e_1_3_2_1_28_1","volume-title":"Structure and Dynamics of Networks","author":"Newman M. J.","year":"2006","unstructured":"M. J. Newman , A. Barabasi , and D. J. Watts . Structure and Dynamics of Networks . Princeton University Press , 2006 . M. J. Newman, A. Barabasi, and D. J. Watts. Structure and Dynamics of Networks. Princeton University Press, 2006."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804052"}],"event":{"name":"SPAA '12: 24th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Pittsburgh Pennsylvania USA","acronym":"SPAA '12"},"container-title":["Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2312005.2312031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:48Z","timestamp":1750236528000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,25]]},"references-count":29,"alternative-id":["10.1145\/2312005.2312031","10.1145\/2312005"],"URL":"https:\/\/doi.org\/10.1145\/2312005.2312031","relation":{},"subject":[],"published":{"date-parts":[[2012,6,25]]},"assertion":[{"value":"2012-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}