Leader election

Known as: Election (disambiguation), Leader (disambiguation) 
In distributed computing, leader election is the process of designating a single process as the organizer of some task distributed among several… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1949-2018
020406019492017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
We present an efficient randomized algorithm for leader election in large-scale distributed systems. The proposed algorithm is… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In the leader election problem, there are n processors of which (1 - b)n are good. The problem is to design a distributed… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper provides a realization of distributed leader election without having any eventual timely links. Progress is guaranteed… (More)
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We study the degree of synchrony required to implement the leader election failure detector Ω and to solve consensus in partially… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Leader election is a very important problem, not only in wired networks, but in mobile, ad hoc networks as well. Existing… (More)
  • table I
  • table II
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We consider the problem of secure leader election and propose two cheat-proof election algorithms : Secure Extrema Finding… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We introduce the notion of stable leader election and derive several algorithms for this problem. Roughly speaking, a leader… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present two new leader election algorithms for mobile ad hoc networks. The algorithms ensure that eventually each connected… (More)
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A distributed system is self-stabilizing if it can be started in any possible global state. Once started the system regains its… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
This paper develops linear time distributed algorithms for a class of problems in an asynchronous communication network. Those… (More)
Is this relevant?