Lecture Notes
Class 5
Description:
Lecture presentation on the EIG algorithm for Byzantine agreement, number-of-processors lower bound for Byzantine agreement, connectivity bounds, weak Byzantine agreement, and time lower bounds for stopping agreement and Byzantine agreement.
Resource Type:
Lecture Notes
pdf
173 kB
Class 5
Course Info
Instructor
As Taught In
Fall
2009
Level
Learning Resource Types
assignment
Problem Sets
notes
Lecture Notes
