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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf74784dad0
DTSTART;TZID=America/Toronto:20250626T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250626T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-jacob-skitsko-3
SUMMARY:C&O Reading Group -Jacob Skitsko
CLASS:PUBLIC
DESCRIPTION:TITLE: Fault Tolerant Routing and High Dimensional Expanders\n
 \nSPEAKER:\n Jacob Skitsko\n\nAFFILIATION:\n University of Waterloo\n\nLOC
 ATION:\n MC 6029\n\nABSTRACT: We will go over some recent results about fa
 ult tolerant\nrouting from Bafna\, Minzer\, Vyas. Two parallel series of w
 orks from\nthe last few years from Bafna\, Lifshitz\, Minzer\, Vyas as wel
 l as\nDikstein\, Dinur\, Lubotzky has led to size efficient PCPs by using 
 high\ndimensional expanders. We will comment on the context for these work
 s\,\nand briefly go over some high level ideas. Then\, we will talk about 
 an\napplication to fault tolerant rounding. The goal in this problem is to
 \ndesign a sparse network supporting efficient fault tolerant\ninteraction
 s between all pairs of nodes. Using the size efficient PCP\nconstruction\,
  Bafna and Minzer gave a construction of constant degree\nnetworks with ef
 ficient protocols that tolerate a constant fraction of\nadversarial edge f
 aults.
DTSTAMP:20260403T080408Z
END:VEVENT
END:VCALENDAR