Deterministic Leader Election

Deterministic Leader Election is a leader election protocol that belongs to the class of distributed algorithms, specifically characterized by its use of predetermined rules and system states to guarantee a unique and predictable outcome in selecting a leader without reliance on randomness or probabilistic choices.

19

Publications

848

Citations

42

Authors

43

Institutions

Publications per year

2017–2026

6

Authors

42

  1. WZ
    Wei Zhan

    Harbin Institute of Technology, China

    2 publications · 49 citations

    2

    h-index

  2. TK
    Tsvi Kopelowitz

    University of Michigan, United States

    2 publications · 49 citations

    2

    h-index

  3. RW
    Ruosong Wang

    Carnegie Mellon University, United States

    2 publications · 49 citations

    2

    h-index

  4. SP
    Seth Pettie

    University of Michigan, United States

    2 publications · 49 citations

    2

    h-index

  5. LL
    Lawrence L. Larmore

    University of Nevada, Las Vegas, United States

    2 publications · 29 citations

    2

    h-index

1–5 of 42

Venues

  1. Distributed Computing

    2 publications · 206 citations

    2

    h-index

  2. ACM Transactions on Algorithms

    TALG · 2 publications · 48 citations

    2

    h-index

  3. Symposium on Discrete Algorithms

    Conference · 1 publications · 43 citations

    1

    h-index

  4. SIAM Journal on Computing

    1 publications · 56 citations

    1

    h-index

  5. Information Processing Letters

    1 publications · 18 citations

    1

    h-index

1–5