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:20260404T020041Z
UID:5e2eda5d21fbc487058519@ist.ac.at
DTSTART:20200203T143000
DTEND:20200203T160000
DESCRIPTION:Speaker: Jukka Suomela\nhosted by Dan Alistarh\nAbstract: A fun
 damental concept in distributed computing is locality: how far does an ind
 ividual node need to see in a large network in order to choose its own par
 t of the solution? In this talk I will introduce a new technique for provi
 ng lower bounds on locality\, round elimination\, and show how it can be a
 pplied in the study of classical graph problems such as maximal matchings 
 and maximal independent sets.
LOCATION:Heinzel Seminar Room / Office Bldg West (I21.EG.101)\, ISTA
ORGANIZER:jkorhone@ist.ac.at
SUMMARY:Jukka Suomela: Locality lower bounds through round elimination
URL:https://talks-calendar.ista.ac.at/events/2620
END:VEVENT
END:VCALENDAR