{"id":"https://openalex.org/W2155704505","doi":"https://doi.org/10.1145/1148109.1148135","title":"On the communication complexity of randomized broadcasting in random-like graphs","display_name":"On the communication complexity of randomized broadcasting in random-like graphs","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W2155704505","doi":"https://doi.org/10.1145/1148109.1148135","mag":"2155704505"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148135","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"conference-paper","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/A5061445188","display_name":"Robert Els\u00e4sser\u22c6","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Robert Els\u00e4sser","raw_affiliation_strings":["University of Paderborn, Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Paderborn, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061445188"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":2.1153,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.8885892,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"148","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T10796","display_name":"Cooperative Communication and Network Coding","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/T12029","display_name":"DNA and Biological Computing","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/broadcasting","display_name":"Broadcasting (networking)","score":0.6687997579574585},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6380154490470886},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5033988356590271},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3870921730995178},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3189510703086853},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19124329090118408}],"concepts":[{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.6687997579574585},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6380154490470886},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5033988356590271},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3870921730995178},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3189510703086853},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19124329090118408}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1148109.1148135","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1530129411","https://openalex.org/W1591378753","https://openalex.org/W1973836644","https://openalex.org/W1975950716","https://openalex.org/W1976969221","https://openalex.org/W1984977694","https://openalex.org/W2008620264","https://openalex.org/W2027377866","https://openalex.org/W2030235801","https://openalex.org/W2038562061","https://openalex.org/W2042587503","https://openalex.org/W2047784567","https://openalex.org/W2056496732","https://openalex.org/W2057399436","https://openalex.org/W2068902429","https://openalex.org/W2082137560","https://openalex.org/W2112643910","https://openalex.org/W2112976607","https://openalex.org/W2117702591","https://openalex.org/W2123637506","https://openalex.org/W2148606196","https://openalex.org/W2152361742","https://openalex.org/W2157004711","https://openalex.org/W2905110430","https://openalex.org/W2997134027","https://openalex.org/W4241669766","https://openalex.org/W4252973173","https://openalex.org/W4312512934"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W4395014643","https://openalex.org/W4391913857","https://openalex.org/W2350741829"],"abstract_inverted_index":{"Broadcasting":[0],"algorithms":[1,29],"have":[2],"a":[3,42,134,183,184,242],"various":[4],"range":[5],"of":[6,11,21,88,138,179,191,204,230,264,275,284],"applications":[7],"in":[8,30,48,102,133,141,170,236,261],"different":[9],"fields":[10],"computer":[12],"science.":[13],"In":[14,288],"this":[15,93,237,301],"paper":[16,238],"we":[17,63,110,125,234],"analyze":[18],"the":[19,36,71,85,166,189,202,205,213,228,231,262,265,282],"number":[20,87,190],"message":[22,89],"transmissions":[23,90,157,192],"generated":[24,91,193],"by":[25,77,92,97,145,194],"efficient":[26,66,196],"randomized":[27],"broadcasting":[28,67,197],"random-like":[31],"networks.":[32],"We":[33,172],"mainly":[34],"consider":[35],"classical":[37],"random":[38,72,106,135,206],"graph":[39,43,136],"model,":[40],"i.e.,":[41],"Gp":[44,137],"with":[45,56,217],"n":[46,140,222],"nodes":[47,53,229],"which":[49,199],"any":[50,130,195],"two":[51],"arbitrary":[52],"are":[54,126,225],"connected":[55,105],"probability":[57,218],"p,":[58],"independently.":[59],"For":[60],"these":[61,177],"graphs,":[62],"present":[64,235],"an":[65,98],"algorithm":[68,94,198,233],"based":[69,240,280],"on":[70,188,241,281,300],"phone":[73,207],"call":[74,208],"model":[75,245],"introduced":[76],"Karp":[78],"et":[79],"al.":[80],"[21],":[81,246],"and":[82,223,249,258,267,292],"show":[83,111,174],"that":[84,112,175,212],"total":[86],"is":[95,182,239,247],"bounded":[96],"asymptotically":[99],"optimal":[100],"value":[101],"almost":[103],"all":[104],"graphs.":[107],"More":[108],"precisely,":[109],"if":[113,221],"p":[114],"\u2265":[115],"log\u03b4":[116],"n/n":[117],"for":[118,176,297],"some":[119],"constant":[120],"\u03b4":[121],">":[122],"2,":[123,286],"then":[124],"able":[127],"to":[128,159,227,272],"broadcast":[129],"information":[131],"r":[132],"size":[139,263],"O(log":[142],"n)":[143],"steps":[144],"using":[146],"at":[147],"most":[148],"O(n":[149],"max{log":[150],"log":[151,153,155],"n,":[152],"n/":[154],"d})":[156],"related":[158],"r,":[160],"where":[161],"d":[162,224],"=":[163],"pn":[164],"denotes":[165],"expected":[167],"average":[168],"degree":[169],"Gp.":[171],"also":[173,269],"kind":[178],"graphs":[180,279],"there":[181],"matching":[185],"lower":[186],"bound":[187],"works":[200],"within":[201],"limits":[203],"model.":[209],"Please":[210],"note":[211],"main":[214],"result":[215],"holds":[216],"1-1/n\u03a9(1),":[219],"even":[220],"unknown":[226],"graph.The":[232],"simple":[243],"communication":[244,256],"scalable,":[248],"robust.":[250],"It":[251],"can":[252,268],"efficiently":[253],"handle":[254],"restricted":[255],"failures":[257],"certain":[259,273],"changes":[260],"network,":[266],"be":[270,295],"extended":[271],"types":[274],"truncated":[276],"power":[277],"law":[278],"models":[283],"[1,":[285],"5].":[287],"addition,":[289],"our":[290],"methods":[291],"results":[293],"might":[294],"useful":[296],"further":[298],"research":[299],"field.":[302]},"counts_by_year":[{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}