Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
Elements of the theory of distributed computing through fundamental algorithmic ideas, lower bound techniques, and impossibility results. Timing assumptions (asynchrony and synchrony), simulations between models (message passing and shared memory), failure types (crash and Byzantine)
Units: 3.0
Hours: 3 to 3