BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20200329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20191027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260405T161910Z
UID:5e5626c944f9c575297193@ist.ac.at
DTSTART:20200303T160000
DTEND:20200303T170000
DESCRIPTION:Speaker: Faith Ellen\nhosted by Dan Alistarh\nAbstract: Abstrac
 t: Consensus is a fundamental problem in the theory of distributed computi
 ng. 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 importanc
 e of different termination conditions. This talk will survey a collection 
 of classical and recent results about consensus in shared-memory systems.
LOCATION:Mondi Seminar Room 2\, Central Building\, ISTA
ORGANIZER:dalistar@ist.ac.at
SUMMARY:Faith Ellen: The Complexity of Consensus and Set Agreement
URL:https://talks-calendar.ista.ac.at/events/2709
END:VEVENT
END:VCALENDAR