conference paper published yes Antoine El-Hayek author 888a098e-fcac-11ee-aff7-d347be57b7250000-0003-4268-7368 Monika H Henzinger author 540c9bbd-f2de-11ec-812d-d04a5be856300000-0002-5008-6530 Stefan Schmid author PODC: Symposium on Principles of Distrubuted Computing 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. Association for Computing Machinery2022Salerno, Italy eng 9781450392624 2211.1135210.1145/3519270.3538460 54-56 https://research-explorer.ista.ac.at/record/22281 yes El-Hayek A, Henzinger M, Schmid S. Brief announcement: Broadcasting time in dynamic rooted trees is linear. In: <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2022:54-56. doi:<a href="https://doi.org/10.1145/3519270.3538460">10.1145/3519270.3538460</a> El-Hayek, A., Henzinger, M., &#38; Schmid, S. (2022). Brief announcement: Broadcasting time in dynamic rooted trees is linear. In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i> (pp. 54–56). Salerno, Italy: Association for Computing Machinery. <a href="https://doi.org/10.1145/3519270.3538460">https://doi.org/10.1145/3519270.3538460</a> A. El-Hayek, M. Henzinger, and S. Schmid, “Brief announcement: Broadcasting time in dynamic rooted trees is linear,” in <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, Salerno, Italy, 2022, pp. 54–56. El-Hayek A, Henzinger M, Schmid S. 2022. Brief announcement: Broadcasting time in dynamic rooted trees is linear. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distrubuted Computing, 54–56. El-Hayek, Antoine, et al. “Brief Announcement: Broadcasting Time in Dynamic Rooted Trees Is Linear.” <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2022, pp. 54–56, doi:<a href="https://doi.org/10.1145/3519270.3538460">10.1145/3519270.3538460</a>. A. El-Hayek, M. Henzinger, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 54–56. El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Brief Announcement: Broadcasting Time in Dynamic Rooted Trees Is Linear.” In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, 54–56. Association for Computing Machinery, 2022. <a href="https://doi.org/10.1145/3519270.3538460">https://doi.org/10.1145/3519270.3538460</a>. 223742026-07-20T11:46:26Z2026-07-24T12:48:29Z