Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,522,763 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Asynchronous system
Berkeley algorithm
Bully algorithm
Byte
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Time-Optimal Leader Election in Population Protocols
Y. Sudo
,
Fukuhito Ooshita
,
Taisuke Izumi
,
H. Kakugawa
,
T. Masuzawa
IEEE Transactions on Parallel and Distributed…
2020
Corpus ID: 218939864
In this article, we present the first leader election protocol in the population protocol model that stabilizes within <inline…
Expand
Highly Cited
2013
Highly Cited
2013
Distributed Protocols for Leader Election
Ittai Abraham
,
D. Dolev
,
Joseph Y. Halpern
International Symposium on Distributed Computing
2013
Corpus ID: 16696823
We do a game-theoretic analysis of leader election, under the assumption that each agent prefers to have some leader than no…
Expand
Highly Cited
2013
Highly Cited
2013
Fast byzantine agreement in dynamic networks
John E. Augustine
,
Gopal Pandurangan
,
Peter Robinson
ACM SIGACT-SIGOPS Symposium on Principles of…
2013
Corpus ID: 12830161
We study Byzantine agreement in dynamic networks where topology can change from round to round and nodes can also experience…
Expand
Highly Cited
2012
Highly Cited
2012
When Do Governments Resort to Election Violence
E. Hafner-Burton
,
Susan D. Hyde
,
Ryan S. Jablonski
2012
Corpus ID: 18288035
When are governments most likely to use election violence, and what factors can mitigate government incentives to resort to…
Expand
Highly Cited
2009
Highly Cited
2009
Moral Bias in Large Elections: Theory and Experimental Evidence
T. Feddersen
,
Sean Gailmard
,
Alvaro Sandroni
American Political Science Review
2009
Corpus ID: 55173201
We argue that large elections may exhibit a moral bias (i.e., conditional on the distribution of preferences within the…
Expand
Highly Cited
2007
Highly Cited
2007
Early Voting and Turnout
Paul Gronke
,
Eva galanes-rosenbaum
,
Peter Miller
PS
2007
Corpus ID: 6524705
Early or convenience voting—understood in this context to be relaxed administrative rules and procedures by which citizens can…
Expand
Highly Cited
2006
Highly Cited
2006
Design and analysis of distributed algorithms
N. Santoro
Wiley series on parallel and distributed…
2006
Corpus ID: 55107315
Preface. 1. Distributed Computing Environments. 1.1 Entities. 1.2 Communication. 1.3 Axioms and Restrictions. 1.3.1 Axioms. 1.3.2…
Expand
Highly Cited
1998
Highly Cited
1998
Distributed algorithms: modeling and analysis with Petri nets
W. Reisig
SMC'98 Conference Proceedings. IEEE…
1998
Corpus ID: 37757698
An algorithm is said to be distributed if it operates on a physically or logically distributed computing architecture. Typically…
Expand
Highly Cited
1992
Highly Cited
1992
How hard is it to control an election? Math
J. Bartholdi
,
C. Tovey
,
M. Trick
1992
Corpus ID: 118466725
Highly Cited
1987
Highly Cited
1987
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems
B. Awerbuch
Symposium on the Theory of Computing
1987
Corpus ID: 456319
This paper develops linear time distributed algorithms for a class of problems in an asynchronous communication network. Those…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE