---
res:
  bibo_abstract:
  - We study the broadcast problem on dynamic networks with n processes. The processes
    communicate in synchronous rounds along an arbitrary rooted tree. The sequence
    of trees is given by an adversary whose goal is to maximize the number of rounds
    until at least one process reaches all other processes. Previous research has
    shown a ⌈(3n-1)/(2)⌉-2 lower bound and an O(n log log n) upper bound. We show
    the first linear upper bound for this problem, namely ⌈(1 + √2) n-1⌉ ~2.4n. Our
    result follows from a detailed analysis of the evolution of the adjacency matrix
    of the network over time.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Antoine
      foaf_name: El-Hayek, Antoine
      foaf_surname: El-Hayek
      foaf_workInfoHomepage: http://www.librecat.org/personId=888a098e-fcac-11ee-aff7-d347be57b725
    orcid: 0000-0003-4268-7368
  - foaf_Person:
      foaf_givenName: Monika H
      foaf_name: Henzinger, Monika H
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=540c9bbd-f2de-11ec-812d-d04a5be85630
    orcid: 0000-0002-5008-6530
  - foaf_Person:
      foaf_givenName: Stefan
      foaf_name: Schmid, Stefan
      foaf_surname: Schmid
  bibo_doi: 10.1145/3519270.3538460
  dct_date: 2022^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/9781450392624
  dct_language: eng
  dct_publisher: Association for Computing Machinery@
  dct_title: 'Brief announcement: Broadcasting time in dynamic rooted trees is linear@'
...