{"id":"https://openalex.org/W7165741066","doi":"https://doi.org/10.4230/lipics.sand.2026.6","title":"Broadcasts in Anonymous, Dynamic Networks: A New Algorithm and Impossibility Results","display_name":"Broadcasts in Anonymous, Dynamic Networks: A New Algorithm and Impossibility Results","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165741066","doi":"https://doi.org/10.4230/lipics.sand.2026.6"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26240","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.6","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.6/LIPIcs.SAND.2026.6.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.6/LIPIcs.SAND.2026.6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049573691","display_name":"Volker Turau","orcid":"https://orcid.org/0000-0001-9964-8816"},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]},{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Turau, Volker","raw_affiliation_strings":["Hamburg University of Technology, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9964-8816","affiliations":[{"raw_affiliation_string":"Hamburg University of Technology, Germany","institution_ids":["https://openalex.org/I159176309","https://openalex.org/I884043246"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049573691"],"corresponding_institution_ids":["https://openalex.org/I159176309","https://openalex.org/I884043246"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66440491,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.954200029373169,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.954200029373169,"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/T12288","display_name":"Optimization and Search Problems","score":0.017400000244379044,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.014600000344216824,"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/node","display_name":"Node (physics)","score":0.614300012588501},{"id":"https://openalex.org/keywords/impossibility","display_name":"Impossibility","score":0.5794000029563904},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5716000199317932},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5098000168800354},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5041999816894531},{"id":"https://openalex.org/keywords/broadcasting","display_name":"Broadcasting (networking)","score":0.4481000006198883},{"id":"https://openalex.org/keywords/dissemination","display_name":"Dissemination","score":0.4311999976634979},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4180000126361847},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.38839998841285706}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.64410001039505},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.614300012588501},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.5794000029563904},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5716000199317932},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5098000168800354},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5041999816894531},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4763000011444092},{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.4481000006198883},{"id":"https://openalex.org/C101780184","wikidata":"https://www.wikidata.org/wiki/Q840576","display_name":"Dissemination","level":2,"score":0.4311999976634979},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4275999963283539},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4180000126361847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3968000113964081},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.38839998841285706},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C83529365","wikidata":"https://www.wikidata.org/wiki/Q4972103","display_name":"Broadcast communication network","level":2,"score":0.35749998688697815},{"id":"https://openalex.org/C114529192","wikidata":"https://www.wikidata.org/wiki/Q922151","display_name":"Broadcast radiation","level":3,"score":0.349700003862381},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34940001368522644},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3294000029563904},{"id":"https://openalex.org/C13540734","wikidata":"https://www.wikidata.org/wiki/Q5318996","display_name":"Dynamic network analysis","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C71112949","wikidata":"https://www.wikidata.org/wiki/Q2873036","display_name":"Self-stabilization","level":3,"score":0.31690001487731934},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3050999939441681},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.28839999437332153},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.2874999940395355},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.2840000092983246},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.257999986410141}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26240","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.6","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.6/LIPIcs.SAND.2026.6.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:doi:10.15480/882.17566","is_oa":true,"landing_page_url":"https://hdl.handle.net/11420/64003","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.4230/lipics.sand.2026.6","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.6","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26240","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.6","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.6/LIPIcs.SAND.2026.6.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165741066.pdf","grobid_xml":"https://content.openalex.org/works/W7165741066.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,116,122],"broadcast":[1,49,102,177],"problem":[2,50,129,178],"is":[3,59,118,142],"the":[4,29,48,176],"task":[5],"of":[6,86,113,139,150,175],"disseminating":[7],"a":[8,11,20,60,78,119,135,148],"message":[9,30],"from":[10],"single":[12],"source":[13],"node":[14,26,89],"to":[15,161],"all":[16],"other":[17],"nodes":[18],"in":[19,51,92,179],"distributed":[21],"system,":[22],"ensuring":[23],"that":[24,68,171],"every":[25],"eventually":[27],"receives":[28],"despite":[31],"possible":[32],"network":[33,58],"constraints":[34],"such":[35],"as":[36],"delays,":[37],"failures,":[38],"or":[39],"limited":[40],"topology":[41,63],"knowledge.":[42],"In":[43],"this":[44,128,159,180],"work,":[45],"we":[46,169],"consider":[47],"anonymous,":[52,107],"synchronous,":[53,108],"dynamic":[54,57,162],"networks.":[55],"A":[56],"network,":[61],"whose":[62],"changes":[64],"over":[65],"time,":[66],"meaning":[67],"communication":[69],"links":[70],"can":[71],"unpredictably":[72],"appear":[73],"and":[74,90,152],"disappear.":[75],"We":[76,156],"present":[77],"randomized":[79,183],"algorithm":[80,117,126],"requiring":[81],"O(log":[82,131],"log":[83,94],"n)":[84,95,132],"bits":[85],"storage":[87],"per":[88],"terminating":[91],"O(m":[93],"rounds":[96],"with":[97,103,164],"high":[98],"probability.":[99],"It":[100],"solves":[101],"stabilizing":[104],"termination":[105],"for":[106,127,172],"1-interval-connected":[109],"networks":[110,163],"using":[111],"messages":[112],"size":[114],"O(1).":[115],"non-idle-start":[120],"algorithm.":[121],"best":[123],"known":[124],"idle-start":[125],"requires":[130],"space,":[133],"also":[134,157],"lower":[136],"memory":[137],"bound":[138],"\u03c9(1)":[140],"space":[141],"known.":[143],"Our":[144],"contribution":[145],"affirmatively":[146],"answers":[147],"question":[149],"Parzych":[151],"Daymude":[153],"(DISC":[154],"2024).":[155],"extend":[158],"result":[160],"bounded":[165],"connectivity":[166],"time.":[167],"Furthermore,":[168],"prove":[170],"two":[173],"variants":[174],"setting":[181],"no":[182],"algorithms":[184],"exist.":[185]},"counts_by_year":[],"updated_date":"2026-08-24T07:32:12.397491","created_date":"2026-06-25T00:00:00"}