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:69ce874dd199d
DTSTART;TZID=America/Toronto:20211126T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20211126T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-ashwin-nayak-0
SUMMARY:Tutte Colloquium - Ashwin Nayak
CLASS:PUBLIC
DESCRIPTION:TITLE: Quantum Distributed Complexity of Graph Diameter and Se
 t\nDisjointness\n\nSpeaker:\n Ashwin Nayak\n\nAffiliation:\n\nUniversity o
 f Waterloo\n\nZoom:\n Please email Emma Watson\n\nABSTRACT:\n\nIn the Con
 gest model\, a network of p processors cooperate to solve\nsome distribute
 d task. Initially\, each processor knows only its unique\nlabel\, the labe
 ls of its neighbours\, and a polynomial upper bound on\np\, the size of th
 e network. The processors communicate with their\nneighbours in rounds. In
  each round\, a processor may perform local\n(quantum) computation\, and s
 end a short message to each of its\nneighbours. How many rounds of communi
 cation are required for some\nprocessor to compute the diameter of the net
 work?
DTSTAMP:20260402T151213Z
END:VEVENT
END:VCALENDAR