Synchronous Distributed Algorithms

Synchronous Distributed Algorithms is a class of distributed algorithms in which processes execute in lockstep rounds, coordinated by a global clock, such that message transmission and reception occur within predictable time bounds, thereby ensuring that all actions in each round are synchronized across the network.

53

Publications

4K

Citations

158

Authors

87

Institutions

Publications per year

2017–2026

12

Authors

158

  1. BA
    Baruch Awerbuch

    Johns Hopkins University, United States

    3 publications · 892 citations

    3

    h-index

  2. US
    Ulrich Schmid

    TU Wien, Austria

    3 publications · 106 citations

    3

    h-index

  3. AH
    Ali H. Sayed

    University of California, Los Angeles, United States

    2 publications · 132 citations

    2

    h-index

  4. WY
    Wotao Yin

    University of California, Los Angeles, United States

    2 publications · 132 citations

    2

    h-index

  5. KY
    Kun Yuan

    University of California, Los Angeles, United States

    2 publications · 132 citations

    2

    h-index

1–5 of 158

Venues

  1. arXiv (Cornell University)

    Repository · 3 publications · 207 citations

    3

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 156 citations

    2

    h-index

  3. IEEE Transactions on Software Engineering

    TSE · 2 publications · 78 citations

    2

    h-index

  4. Journal of the ACM

    JACM · 2 publications · 735 citations

    2

    h-index

  5. SIAM Journal on Computing

    2 publications · 159 citations

    2

    h-index

1–5