 Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary
Graphs Without Identifiers in Population ProtocolsInternational Conference on Principles of Distributed Systems (OPODIS), 2024 |
 Near-Optimal Leader Election in Population Protocols on GraphsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Population Protocols for Graph Class Identification ProblemsInternational Conference on Principles of Distributed Systems (OPODIS), 2021 |
