Outputs (3)

A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols (2025)
Presentation / Conference Contribution
Austin, H., Berenbrink, P., Friedetzky, T., Götte, T., & Hintze, L. (2025, June). A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols. Presented at ACM Symposium on Principles of Distributed Computing (PODC'25), Huatulco, Mexico

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

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, Mexico

Broadcast 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.