{"id":"https://openalex.org/W2495546859","doi":"https://doi.org/10.1145/2933057.2933117","title":"How Asynchrony Affects Rumor Spreading Time","display_name":"How Asynchrony Affects Rumor Spreading Time","publication_year":2016,"publication_date":"2016-07-25","ids":{"openalex":"https://openalex.org/W2495546859","doi":"https://doi.org/10.1145/2933057.2933117","mag":"2495546859"},"language":"en","primary_location":{"id":"doi:10.1145/2933057.2933117","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933117","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006944198","display_name":"George Giakkoupis","orcid":"https://orcid.org/0000-0002-8023-4485"},"institutions":[{"id":"https://openalex.org/I4210133778","display_name":"Inria Rennes - Bretagne Atlantique Research Centre","ror":"https://ror.org/04040yw90","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210133778"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"George Giakkoupis","raw_affiliation_strings":["INRIA, Rennes, France","ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems (Campus de Beaulieu 35042 Rennes cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, Rennes, France","institution_ids":["https://openalex.org/I4210133778","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems (Campus de Beaulieu 35042 Rennes cedex - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012259594","display_name":"Yasamin Nazari","orcid":"https://orcid.org/0000-0003-1315-9355"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Yasamin Nazari","raw_affiliation_strings":["University of Calgary, Calgary, Canada","CPSC - Department of Computer Science [Calgary] (University of Calgary 2500 University Dr. NW Calgary, Alberta Canada T2N 1N4 - Canada)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calgary, Calgary, Canada","institution_ids":["https://openalex.org/I168635309"]},{"raw_affiliation_string":"CPSC - Department of Computer Science [Calgary] (University of Calgary 2500 University Dr. NW Calgary, Alberta Canada T2N 1N4 - Canada)","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009422307","display_name":"Philipp Woelfel","orcid":"https://orcid.org/0000-0002-7847-4631"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Philipp Woelfel","raw_affiliation_strings":["University of Calgary, Calgary, Canada","CPSC - Department of Computer Science [Calgary] (University of Calgary 2500 University Dr. NW Calgary, Alberta Canada T2N 1N4 - Canada)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calgary, Calgary, Canada","institution_ids":["https://openalex.org/I168635309"]},{"raw_affiliation_string":"CPSC - Department of Computer Science [Calgary] (University of Calgary 2500 University Dr. NW Calgary, Alberta Canada T2N 1N4 - Canada)","institution_ids":["https://openalex.org/I168635309"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006944198"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210133778"],"apc_list":null,"apc_paid":null,"fwci":2.6579,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.9100958,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"185","last_page":"194"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rumor","display_name":"Rumor","score":0.8992421627044678},{"id":"https://openalex.org/keywords/asynchrony","display_name":"Asynchrony (computer programming)","score":0.8264881372451782},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7842772006988525},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7220277190208435},{"id":"https://openalex.org/keywords/gossip","display_name":"Gossip","score":0.6241751909255981},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5232483148574829},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5006754398345947},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.46342790126800537},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4370797872543335},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3711455464363098},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29789066314697266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21091657876968384},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11327534914016724}],"concepts":[{"id":"https://openalex.org/C2780469804","wikidata":"https://www.wikidata.org/wiki/Q878352","display_name":"Rumor","level":2,"score":0.8992421627044678},{"id":"https://openalex.org/C2779019669","wikidata":"https://www.wikidata.org/wiki/Q25203946","display_name":"Asynchrony (computer programming)","level":3,"score":0.8264881372451782},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7842772006988525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7220277190208435},{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.6241751909255981},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5232483148574829},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5006754398345947},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46342790126800537},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4370797872543335},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3711455464363098},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29789066314697266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21091657876968384},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11327534914016724},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C39549134","wikidata":"https://www.wikidata.org/wiki/Q133080","display_name":"Public relations","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2933057.2933117","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933117","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01353698v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01353698","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"35th ACM Symposium on Principles of Distributed Computing (PODC 2016), Jul 2016, Chicago, United States. &#x27E8;10.1145/2933057.2933117&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W22683957","https://openalex.org/W167256694","https://openalex.org/W179639306","https://openalex.org/W1609618519","https://openalex.org/W1830042958","https://openalex.org/W1984815674","https://openalex.org/W1991545795","https://openalex.org/W1993079998","https://openalex.org/W2000985696","https://openalex.org/W2005443809","https://openalex.org/W2009356484","https://openalex.org/W2018777507","https://openalex.org/W2031541804","https://openalex.org/W2038562061","https://openalex.org/W2047708977","https://openalex.org/W2047784567","https://openalex.org/W2052605628","https://openalex.org/W2071294844","https://openalex.org/W2076305111","https://openalex.org/W2100307883","https://openalex.org/W2103160469","https://openalex.org/W2117905067","https://openalex.org/W2149345630","https://openalex.org/W2157004711","https://openalex.org/W2159732236","https://openalex.org/W2494932805","https://openalex.org/W2527617737","https://openalex.org/W2621876985","https://openalex.org/W2952262284","https://openalex.org/W2953293301","https://openalex.org/W6629956820","https://openalex.org/W6650897355","https://openalex.org/W6677569594"],"related_works":["https://openalex.org/W110080003","https://openalex.org/W170824903","https://openalex.org/W2902829144","https://openalex.org/W4300445040","https://openalex.org/W2065972502","https://openalex.org/W2029777907","https://openalex.org/W2952550120","https://openalex.org/W1571006103","https://openalex.org/W4246685877","https://openalex.org/W2297595240"],"abstract_inverted_index":{"In":[0,11,95],"standard":[1,142],"randomized":[2],"(push-pull)":[3],"rumor":[4,25,30,104,113,134,196,244],"spreading,":[5],"nodes":[6,122,162,181],"communicate":[7],"in":[8,20,80,86,92,123,235],"synchronized":[9],"rounds.":[10],"each":[12,50],"round":[13],"every":[14,61],"node":[15,51,62,118],"contacts":[16,63],"a":[17,64,76,112,116],"random":[18,65],"neighbor":[19,33,66],"order":[21],"to":[22,31,120,178],"exchange":[23],"the":[24,29,38,103,109,124,131,141,156,169,186,192,205,213,238,247,252],"(i.e.,":[26],"either":[27],"push":[28],"its":[32,68],"or":[34],"pull":[35],"it":[36],"from":[37],"neighbor).":[39],"A":[40],"natural":[41],"asynchronous":[42,72,132,170,207],"variant":[43,73,241],"of":[44,229,242],"this":[45,96],"algorithm":[46],"is":[47,74,137,199,233],"one":[48],"where":[49,155],"has":[52,246],"an":[53],"independent":[54],"Poisson":[55],"clock":[56,69],"with":[57,166,182],"rate":[58],"1,":[59],"and":[60,89],"whenever":[67],"ticks.":[70],"This":[71],"arguably":[75],"more":[77],"realistic":[78],"model":[79],"various":[81],"settings,":[82],"including":[83],"message":[84],"broadcasting":[85],"communication":[87],"networks,":[88],"information":[90],"dissemination":[91],"social":[93],"networks.":[94],"paper":[97],"we":[98,146,189],"study":[99],"how":[100],"asynchrony":[101],"affects":[102],"spreading":[105,135,197,245],"time,":[106],"that":[107,130,148,191,234],"is,":[108],"time":[110,136,175,198],"before":[111],"originated":[114],"at":[115,173],"single":[117],"spreads":[119],"all":[121,161,180],"graph.":[125],"Our":[126],"first":[127,231],"result":[128,232],"states":[129],"push-pull":[133,158,195,254],"asymptotically":[138],"bounded":[139,200],"by":[140,201,220],"synchronous":[143,157,194,243,253],"time.":[144,208],"Precisely,":[145],"show":[147,190],"for":[149,215],"any":[150],"graph":[151],"G":[152],"on":[153],"n-nodes,":[154],"protocol":[159,171],"informs":[160],"within":[163],"T(G)":[164],"rounds":[165],"high":[167,183],"probability,":[168],"needs":[172],"most":[174],"O(T(G)+log":[176],"n)":[177,203],"inform":[179],"probability.":[184],"On":[185],"other":[187],"hand,":[188],"expected":[193,206],"O(\u221a":[202],"times":[204],"These":[209],"results":[210],"improve":[211],"upon":[212],"bounds":[214],"both":[216],"directions":[217],"shown":[218],"recently":[219],"Acan":[221],"et":[222],"al.":[223],"(PODC":[224],"2015).":[225],"An":[226],"interesting":[227],"implication":[228],"our":[230],"regular":[236],"graphs,":[237],"weaker":[239],"push-only":[240],"same":[248],"asymptotic":[249],"performance":[250],"as":[251],"algorithm.":[255]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}
