v1v2 (latest)

Near-Optimal Leader Election in Population Protocols on Graphs

ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022

25 May 2022

Dan Alistarh

Papers citing "Near-Optimal Leader Election in Population Protocols on Graphs"

2 / 2 papers shown

Title
Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population ProtocolsInternational Conference on Principles of Distributed Systems (OPODIS), 2024 Haruki Kanaya R. Eguchi Taisho Sasada M. Inoue 74 1 0 06 Nov 2024
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of StatesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 D. Yokota Y. Sudo Fukuhito Ooshita Toshimitsu Masuzawa 79 5 0 15 May 2023