 Complete Graph Identification in Population ProtocolsSafety-critical Systems Symposium (SSS), 2024 |
 The Expressive Power of Uniform Population Protocols with Logarithmic
SpaceSymposium on Algorithmic Foundations of Dynamic Networks (AFDN), 2024 |
 Dynamic Size Counting in the Population Protocol ModelACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2024 |
 On the Hierarchy of Distributed Majority ProtocolsInternational Conference on Principles of Distributed Systems (OPODIS), 2022 |
 Dynamic size counting in population protocolsSymposium on Algorithmic Foundations of Dynamic Networks (AFDN), 2022 |
 Fast and Succinct Population Protocols for Presburger ArithmeticSymposium on Algorithmic Foundations of Dynamic Networks (AFDN), 2022 |
 A time and space optimal stable population protocol solving exact
majorityACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 |
 A survey of size counting in population protocolsTheoretical Computer Science (TCS), 2021 |
 Fast Consensus via the Unconstrained Undecided State DynamicsACM-SIAM Symposium on Discrete Algorithms (SODA), 2021 |
 Message complexity of population protocolsInternational Symposium on Distributed Computing (DISC), 2020 |
 On Counting the Population SizeACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2019 |
 Composable computation in discrete chemical reaction networksDistributed computing (Distrib. Comput.), 2019 |
