23 citations · 23 across the 2 of their papers we have counts for
2 papers
cs.DC2016★ 23 cited
Time and Space Optimal Counting in Population Protocols
James Aspnes, Joffroy Beauquier, Janna Burman +1
This work concerns the general issue of combined optimality in terms of time and space complexity. In this context, we study the problem of (exact) counting resource-limited and pa…
cs.DC2016
Self-Stabilizing Maximal Matching and Anonymous Networks
Johanne Cohen, Jonas Lefèvre, Khaled Maâmra +2
We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is moves with high probability, under the adversarial dist…