Deterministic algorithms solve adaptive self-organization for homogeneous goal distributions in anonymous dynamic networks, with randomized extensions for arbitrary distributions when goal distributions are known.
b.v t.state̸=Lockedfor allv∈Mt, G
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Adaptive Self-Organization in Anonymous Dynamic Networks
Deterministic algorithms solve adaptive self-organization for homogeneous goal distributions in anonymous dynamic networks, with randomized extensions for arbitrary distributions when goal distributions are known.