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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dfad320404f
DTSTART;TZID=America/Toronto:20221216T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221216T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-daniel-panario
SUMMARY:Tutte Colloquium - Daniel Panario
CLASS:PUBLIC
DESCRIPTION:TITLE: Probabilistic root finding in code-based cryptography\n
 \nSpeaker:\n Daniel Panario\n\nAffiliation:\n School of Mathematics and St
 atistics\, Carleton University\n\nLocation:\n MC 5501 or contact Eva Lee
  for Zoom link\n\nABSTRACT: Factorization of polynomials over finite fie
 lds\, and the\nparticular subproblem of finding roots of polynomials\, ha
 ve many\napplications in diverse areas such as computer algebra\, cryptogr
 aphy\nand coding theory\, among many others. In practice\, fast factoriza
 tion\nalgorithms are probabilistic.
DTSTAMP:20260415T152226Z
END:VEVENT
END:VCALENDAR