Message Complexity

Message Complexity is a metric in distributed computing that quantifies the total number of messages required by a leader election algorithm to achieve consensus, distinguishing it from other complexity measures by focusing exclusively on communication overhead.

374

Publications

19.3K

Citations

796

Authors

337

Institutions

Publications per year

2017–2026

40

Authors

796

  1. DP
    David Peleg

    Weizmann Institute of Science, Israel

    8 publications · 467 citations

    8

    h-index

  2. GP
    Gopal Pandurangan

    Nanyang Technological University, Singapore

    7 publications · 183 citations

    7

    h-index

  3. DD
    Danny Dolev

    Hebrew University of Jerusalem, Israel

    7 publications · 338 citations

    7

    h-index

  4. KM
    Khaled M. Alzoubi

    Illinois Institute of Technology, United States

    7 publications · 2.3K citations

    7

    h-index

  5. PW
    Peng‐Jun Wan

    Illinois Institute of Technology, United States

    7 publications · 2.3K citations

    7

    h-index

1–5 of 796

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 12 publications · 548 citations

    12

    h-index

  2. Journal of the ACM

    JACM · 12 publications · 621 citations

    11

    h-index

  3. arXiv (Cornell University)

    Repository · 8 publications · 114 citations

    8

    h-index

  4. IEEE Transactions on Mobile Computing

    TMCCI · 8 publications · 1.1K citations

    8

    h-index

  5. IEEE Transactions on Computers

    6 publications · 208 citations

    6

    h-index

1–5