: Leader election algorithms solve the instability problem in the network which is caused by leader failure .In this paper, we propose a new leader election algorithm in two dimens...
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
Abstract. In this paper, we mix two well-known approaches of the fault-tolerance: robustness and stabilization. Robustness is the aptitude of an algorithm to withstand permanent fa...
In this paper we introduce the regional consecutive leader election (RCLE) problem, which extends the classic leader election problem to the ever-changing environment of mobile ad-...
Hyun Chul Chung, Peter Robinson, Jennifer L. Welch
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...