BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6870f3d937d2c
DTSTART;TZID=America/Toronto:20211126T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20211126T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-ashwin-nayak-0
SUMMARY:Tutte Colloquium - Ashwin Nayak
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Quantum Distributed Complexity of Graph Dia
 meter and Set\nDisjointness\n\nSpeaker:\n Ashwin Nayak\n\nAffiliation:\n\n
 University of À¶Ý®ÊÓƵ\n\nZoom:\n Please email Emma Watson\n\nABSTRACT:\n
 \nIn the Congest model\, a network of p processors cooperate to solve\nsom
 e distributed task. Initially\, each processor knows only its unique\nlabe
 l\, the labels of its neighbours\, and a polynomial upper bound on\np\, th
 e size of the network. The processors communicate with their\nneighbours i
 n rounds. In each round\, a processor may perform local\n(quantum) computa
 tion\, and send a short message to each of its\nneighbours. How many round
 s of communication are required for some\nprocessor to compute the diamete
 r of the network?\n 
DTSTAMP:20250711T112201Z
END:VEVENT
END:VCALENDAR