Introduces CIRCLES protocol that computes relative majority with k^3 states via circular lists where no two agents of same color share a list.
Population protocols with unordered data
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
IO-PP[<] recognizes exactly the unambiguous star-free languages; stabilization is undecidable for PP[<] and IO-PP[+1] but conditionally decidable for IO-PP[<].
citing papers explorer
-
Ranking Opinions with Few States in Population Protocols
Introduces CIRCLES protocol that computes relative majority with k^3 states via circular lists where no two agents of same color share a list.
-
Population Protocols over Ordered Agents
IO-PP[<] recognizes exactly the unambiguous star-free languages; stabilization is undecidable for PP[<] and IO-PP[+1] but conditionally decidable for IO-PP[<].