Randomized Distributed Algorithms

Randomized Distributed Algorithms is a class of distributed algorithms that incorporates randomness as a fundamental mechanism to achieve coordination, fault tolerance, or efficiency in a decentralized computational environment where processes operate concurrently and communicate through message passing.

195

Publications

13.7K

Citations

370

Authors

189

Institutions

Publications per year

2017–2026

41

Authors

370

  1. GP
    Gopal Pandurangan

    Nanyang Technological University, Singapore

    12 publications · 531 citations

    12

    h-index

  2. HI
    Hideaki Ishii

    Tokyo Institute of Technology, Japan

    9 publications · 409 citations

    9

    h-index

  3. RT
    Roberto Tempo

    Politecnico di Torino, Italy

    8 publications · 398 citations

    8

    h-index

  4. DS
    Devavrat Shah

    Massachusetts Institute of Technology, United States

    7 publications · 3.4K citations

    7

    h-index

  5. RW
    Roger Wattenhofer

    ETH Zurich, Switzerland

    6 publications · 252 citations

    6

    h-index

1–5 of 370

Venues

  1. arXiv (Cornell University)

    Repository · 7 publications · 154 citations

    7

    h-index

  2. Distributed Computing

    5 publications · 297 citations

    5

    h-index

  3. SIAM Journal on Computing

    5 publications · 789 citations

    5

    h-index

  4. Journal of the ACM

    JACM · 4 publications · 285 citations

    4

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 146 citations

    3

    h-index

1–5