Byzantine Generals Problem

The "Byzantine Generals Problem" is a foundational theoretical construct in distributed computing that models the challenge of achieving consensus among multiple parties in the presence of arbitrary failures, where some participants may behave maliciously or unpredictably, thereby distinguishing it from simpler fault-tolerance problems by requiring agreement despite potentially contradictory or false information.

41

Publications

15.3K

Citations

71

Authors

39

Institutions

Publications per year

2017–2026

4

Variants

Byzantine Generals' Problem

Authors

71

  1. LL
    Leslie Lamport

    Digital Wave (United States), United States

    5 publications · 6.4K citations

    5

    h-index

  2. NL
    Nancy Lynch

    Massachusetts Institute of Technology, United States

    4 publications · 5.4K citations

    4

    h-index

  3. MJ
    Michael J. Fischer

    Yale University, United States

    4 publications · 5K citations

    4

    h-index

  4. MS
    Michael S. Paterson

    University of Warwick, United Kingdom

    3 publications · 4.9K citations

    3

    h-index

  5. TL
    T. Larrabee

    University of California, Santa Cruz, United States

    2 publications · 124 citations

    2

    h-index

1–5 of 71

Venues

  1. Journal of the ACM

    JACM · 4 publications · 5.4K citations

    4

    h-index

  2. 2

    h-index

  3. arXiv (Cornell University)

    Repository · 2 publications · 26 citations

    2

    h-index

  4. Sensors

    1 publications · 12 citations

    1

    h-index

  5. 1

    h-index

1–5