Randomized Consensus Algorithms

Randomized Consensus Algorithms is a class of distributed algorithms that achieve agreement among asynchronous processes in the presence of faults by employing randomization to circumvent deterministic impossibility results, distinguishing it from deterministic consensus protocols through its probabilistic termination and decision guarantees.

93

Publications

4.6K

Citations

169

Authors

97

Institutions

Publications per year

2017–2026

17

Variants

Randomized Consensus Algorithm

Authors

169

  1. JA
    James Aspnes

    Yale University, United States

    14 publications · 519 citations

    13

    h-index

  2. HI
    Hideaki Ishii

    Tokyo Institute of Technology, Japan

    8 publications · 308 citations

    8

    h-index

  3. HA
    Hagit Attiya

    Technion – Israel Institute of Technology, Israel

    6 publications · 213 citations

    6

    h-index

  4. KC
    Keren Censor

    Technion – Israel Institute of Technology, Israel

    6 publications · 170 citations

    6

    h-index

  5. RT
    Roberto Tempo

    Politecnico di Torino, Italy

    5 publications · 231 citations

    5

    h-index

1–5 of 169

Venues

  1. Distributed Computing

    8 publications · 381 citations

    8

    h-index

  2. Automatica

    5 publications · 926 citations

    5

    h-index

  3. SIAM Journal on Computing

    5 publications · 203 citations

    5

    h-index

  4. Journal of the ACM

    JACM · 4 publications · 218 citations

    4

    h-index

  5. Theoretical Computer Science

    2 publications · 51 citations

    2

    h-index

1–5