Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape
(2025)
Presentation / Conference Contribution
Austin, H., Gadouleau, M., Mertzios, G., & Trehan, A. (2025, June). Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape. Presented at 2025 Symposium on Principles of Distributed Computing, Huatulco, Mexico
Outputs (4)
Brief Announcement: Amnesiac Flooding: Easy to Break, Hard to Escape (2025)
Presentation / Conference Contribution
Austin, H., Gadouleau, M., Mertzios, G. B., & Trehan, A. (2025, June). Brief Announcement: Amnesiac Flooding: Easy to Break, Hard to Escape. Presented at ACM Principles of Distributed Computing (PODC) 2025, Huatulco, MexicoBroadcast is a central problem in distributed computing. Recently, Hussak and Trehan [PODC'19/DC'23] proposed a stateless broadcasting protocol (Amnesiac Flooding), which was surprisingly proven to terminate in asymptotically optimal time (linear in... Read More about Brief Announcement: Amnesiac Flooding: Easy to Break, Hard to Escape.
Linear Programming complementation (2025)
Journal Article
Gadouleau, M., Mertzios, G., & Zamaraev, V. (2025). Linear Programming complementation. Theoretical Computer Science, 1032, Article 115087. https://doi.org/10.1016/j.tcs.2025.115087
Generalising the maximum independent set algorithm via Boolean networks (2025)
Journal Article
Gadouleau, M., & Kutner, D. C. (2025). Generalising the maximum independent set algorithm via Boolean networks. Information and Computation, 303, Article 105266. https://doi.org/10.1016/j.ic.2025.105266A simple greedy algorithm to find a maximal independent set (MIS) in a graph starts with the empty set and visits every vertex, adding it to the set if and only if none of its neighbours are already in the set. In this paper, we consider the generali... Read More about Generalising the maximum independent set algorithm via Boolean networks.