Asynchronous Leader Election

Asynchronous Leader Election is a distributed computing problem concerning the design of algorithms that enable a network of processes operating without global time or message delivery guarantees to converge on a single, unique process as the leader.

40

Publications

1.6K

Citations

83

Authors

51

Institutions

Publications per year

2017–2026

1

Authors

83

  1. MR
    Michel Raynal

    Institut de Recherche en Informatique et Systèmes Aléatoires, France

    6 publications · 148 citations

    6

    h-index

  2. SK
    Shay Kutten

    Technion – Israel Institute of Technology, Israel

    3 publications · 119 citations

    3

    h-index

  3. RO
    Rafail Ostrovsky

    University of California, Los Angeles, United States

    2 publications · 53 citations

    2

    h-index

  4. MY
    Moti Yung

    Columbia University, United States

    2 publications · 53 citations

    2

    h-index

  5. AP
    Andrzej Pelc

    Université du Québec en Outaouais, Canada

    2 publications · 52 citations

    2

    h-index

1–5 of 83

Venues

  1. SIAM Journal on Computing

    3 publications · 65 citations

    3

    h-index

  2. Distributed Computing

    2 publications · 59 citations

    2

    h-index

  3. IEEE Transactions on Computers

    2 publications · 73 citations

    2

    h-index

  4. Information Processing Letters

    2 publications · 29 citations

    2

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 52 citations

    2

    h-index

1–5