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
Parents
41
Michael O. Rabin · 1983 · 585 citations
The Byzantine generals strike again
Danny Dolev · Journal of Algorithms · 1982 · 573 citations
The Ripple Protocol Consensus Algorithm
David Schwartz, Noah Youngs, Arthur Britto · 2014 · 530 citations
1–5 of 41
71
5
h-index
4
h-index
4
h-index
3
h-index
2
h-index
1–5 of 71
39

Cornell University
Ithaca, United States
5 h-index
5 publications
698 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
5 publications
5.9K citations
Yale University
New Haven, United States
3 h-index
3 publications
4.9K citations
SRI International
Menlo Park, United States
3 h-index
6 publications
18.3K citations

University of Warwick
Coventry, United Kingdom
3 h-index
3 publications
4.9K citations
University of California, Santa Cruz
Santa Cruz, United States
2 h-index
6 publications
326 citations
Stanford University
Stanford, United States
2 h-index
3 publications
595 citations
Université Paris Cité
Paris, France
1 h-index
2 publications
120 citations
1–8 of 39
JACM · 4 publications · 5.4K citations
4
h-index
2 publications · 47 citations
2
h-index
Repository · 2 publications · 26 citations
2
h-index
1 publications · 12 citations
1
h-index
Conference · 1 publications · 39 citations
1
h-index
1–5