Asynchronous Distributed Algorithms

Asynchronous Distributed Algorithms is a subclass of distributed algorithms characterized by the absence of a global clock and reliance on local timing, where processes operate at arbitrary speeds and message delays are unbounded, thereby requiring coordination mechanisms that do not depend on time-based assumptions.

380

Publications

23.1K

Citations

796

Authors

340

Institutions

Publications per year

2017–2026

84

Authors

796

  1. DP
    Dimitri P. Bertsekas

    Massachusetts Institute of Technology, United States

    9 publications · 2.9K citations

    9

    h-index

  2. JM
    Jacques M. Bahi

    Université de Franche-Comté, France

    7 publications · 194 citations

    7

    h-index

  3. RC
    Raphaël Couturier

    Franche-Comté Électronique Mécanique Thermique et Optique - Sciences et Technologies, France

    6 publications · 148 citations

    6

    h-index

  4. HA
    Hagit Attiya

    Technion – Israel Institute of Technology, Israel

    6 publications · 320 citations

    6

    h-index

  5. EG
    Eli Gafni

    University of California, Los Angeles, United States

    6 publications · 183 citations

    6

    h-index

1–5 of 796

Venues

  1. IEEE Transactions on Automatic Control

    20 publications · 3.8K citations

    19

    h-index

  2. arXiv (Cornell University)

    Repository · 26 publications · 862 citations

    17

    h-index

  3. SIAM Journal on Computing

    8 publications · 523 citations

    8

    h-index

  4. Journal of the ACM

    JACM · 8 publications · 957 citations

    8

    h-index

  5. IEEE Transactions on Signal Processing

    8 publications · 552 citations

    8

    h-index

1–5