First population protocol solving collision detection with poly(n) states per agent in O(√n log^{3/2} n) parallel time w.h.p.
Self-stabilizing leader election in population protocols over arbitrary communication graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols
First population protocol solving collision detection with poly(n) states per agent in O(√n log^{3/2} n) parallel time w.h.p.