The Complexity of Consensus and Set Agreement
Date
Tuesday, March 3, 2020 16:00 - 17:00
Speaker
Faith Ellen (University of Toronto)
Location
Mondi Seminar Room 2, Central Building
Series
Seminar/Talk
Tags
Mathematics and CS Seminar
Host
Dan Alistarh
Contact
Abstract: Consensus is a fundamental problem in the theory of distributed computing. Research about consensus and its generalization, set agreement, has helped the theory of distributed computing community understand issues of computability and complexity, the power of randomness, and the importance of different termination conditions. This talk will survey a collection of classical and recent results about consensus in shared-memory systems.