Lecture Notes

Class 5


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

Course Info

Learning Resource Types

assignment Problem Sets
notes Lecture Notes