Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols

Renaming in an asynchronous environment

H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk · 1990

Earlier work this paper cites.

Immediate atomic snapshots and fast renaming (extended abstract)

E. Borowsky and E. Gafni · 1993

Earlier work this paper cites.

Fault-local distributed mending

S. Kutten and D. Peleg · 1995

Earlier work this paper cites.

Time-adaptive self stabilization

S. Kutten and B. Patt-Shamir · 1997

Earlier work this paper cites.

Long-lived, fast, waitfree renaming with optimal name space and high throughput

W. Eberly, L. Higham, and J/ Warpechowska-Gruca · 1998

Earlier work this paper cites.

Randomized naming using wait-free shared variables

A. Panconesi, M. Papatriantafilou, P. Tsigas, and P.M.B. Vitányi · 1998

Earlier work this paper cites.

Fast, wait-free (2 k )-renaming

Y. Afek and M. Merritt · 1999

Earlier work this paper cites.

Optimal reactive k -stabilization: The case of mutual exclusion

J. Beauquier, C. Genolini, and S. Kutten · 1999

Earlier work this paper cites.

Xee. scalable self-stabilization

S. Gosh · 1999

Earlier work this paper cites.

The topological structure of asynchronous computability

M. Herlihy and N. Shavit · 1999

Earlier work this paper cites.

Adaptive and efficient algorithms for lattice agreement and renaming

H. Attiya and A. Fouren · 2001

Earlier work this paper cites.

A lower bound on dynamic k-stabilization in asynchronous systems

C. Genolini and S. Tixeuil · 2002

Earlier work this paper cites.

Computation in networks of passively mobile finite-state sensors

D. Angluin, J. Aspnes, Z. Diamadi, M.J. Fischer, and R. Peralta · 2004

Earlier work this paper cites.

Self-stabilizing population protocols

D. Angluin, J. Aspnes, M.J. Fischer, and H. Jiang · 2005

Earlier work this paper cites.

A 1-strong self-stabilizing transformer

J. Beauquier, S. Delaët, and S. Haddad · 2006

Earlier work this paper cites.

Self-stabilizing leader election in networks of finite-state anonymous agents

M.J. Fischer and H. Jiang · 2006

Earlier work this paper cites.

Asynchronous exclusive selection

B.S. Chlebus and D.R. Kowalski · 2008

Cited alongside, same era.

Passively mobile communicating machines that use restricted space

I. Chatzigiannakis, O. Michail, S. Nikolaou, A. Pavlogiannis, and P.G. Spirakis · 2011

Cited alongside, same era.

Non-deterministic population protocols

J. Beauquier, J. Burman, L. Rosaz, and B. Rozoy · 2012

Cited alongside, same era.

How to prove impossibility under global fairness: On space complexity of self-stabilizing leader election on a population protocol model

S. Cai, T. Izumi, and K. Wada · 2012

Cited alongside, same era.

On space complexity of self-stabilizing leader election in mediated population protocol

R. Mizoguchi, H. Ono, S. Kijima, and M. Yamashita · 2012

Cited alongside, same era.

Self-stabilizing leader election in population protocols over arbitrary communication graphs

Simple and efficient leader election

P. Berenbrink, D. Kaaser, P. Kling, and L. Otterbach · 2018

Later among the works it cites.

Stable leader election in population protocols requires linear time

D. Doty and D. Soloveichik · 2018

Later among the works it cites.

Space-optimal naming in population protocols

J. Burman, J. Beauquier, and D. Sohier · 2019

Later among the works it cites.

Self-stabilizing leader election

H.-P. Chen and H.-L. Chen · 2019

Later among the works it cites.

Almost logarithmic-time space optimal leader election in population protocols

L. Gąsieniec, G. Stachowiak, and P. Uznański · 2019

Later among the works it cites.

Optimal time and space leader election in population protocols

P. Berenbrink, G. Giakkoupis, and P. Kling · 2020

Later among the works it cites.