 Complete Graph Identification in Population ProtocolsSafety-critical Systems Symposium (SSS), 2024 |
 Population Protocols for Exact Plurality Consensus -- How a small chance
of failure helps to eliminate insignificant opinionsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Fast Convergence of -Opinion Undecided State Dynamics in the
Population Protocol ModelACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 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 |
 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 |
 Uniform Bipartition in the Population Protocol Model with Arbitrary
Communication GraphsInternational Conference on Principles of Distributed Systems (OPODIS), 2020 |
 Approximate Majority With Catalytic InputsInternational Conference on Principles of Distributed Systems (OPODIS), 2020 |
 Distributed Computation with Continual Population GrowthDistributed computing (Distrib. Comput.), 2020 |
 Robust Comparison in Population ProtocolsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
