Asymptotic analysis of a leader election algorithm
From MaRDI portal
Publication:2503299
DOI10.1016/j.tcs.2006.03.027zbMath1103.68136OpenAlexW2073425714MaRDI QIDQ2503299
Christian Lavault, Guy Louchard
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.027
Related Items
The truncated geometric election algorithm: duration of the election ⋮ The asymmetric leader election algorithm: Number of survivors near the end of the game
Cites Work