1. Burman, J., Doty, D., Nowak, T., Severson, E.E., Xu, C.: Efficient self-stabilizing leader election in population protocols. CoRR, vol. abs/1907.06068 (2019). http://arxiv.org/abs/1907.06068
2. Gasieniec, L., Stachowiak, G.: Fast space optimal leader election in population protocols. CoRR, vol. abs/1704.07649 (2017). http://arxiv.org/abs/1704.07649
3. Berenbrink, P., Kaaser, D., Kling, P., Otterbach, L.: Simple and efficient leader election. In: Seidel, R. (ed.) 1st Symposium on Simplicity in Algorithms (SOSA 2018), ser. OpenAccess Series in Informatics (OASIcs), vol. 61, pp. 9:1–9:11. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018). http://drops.dagstuhl.de/opus/volltexte/2018/8302
4. Kim, T.W., Kim, E.H., Kim, J.K., Kim, T.Y.: A leader election algorithm in a distributed computing system. In: Proceedings of the Fifth IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems, pp. 481–485 (1995)
5. Singh, G.: Leader election in complete networks. In: Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, ser. PODC 1992, pp. 179–190. Association for Computing Machinery, New York (1992). https://doi.org/10.1145/135419.135457