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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cea1d13095b
DTSTART;TZID=America/Toronto:20200821T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200821T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-leo-ducas
SUMMARY:Tutte Colloquium - Léo Ducas
CLASS:PUBLIC
DESCRIPTION:TITLE: An Algorithmic Reduction Theory for Binary Codes: LLL a
 nd more\n\nJoint work with Thomas Debris-Alazard and Wessel van Woerden\n\
 nSpeaker:\n Léo Ducas\n\nAffiliation:\n Centrum Wiskunde & Informatica 
 (CWI)\n\nZoom:\n Please email Emma Watson\n\nABSTRACT:\n\nLattice reducti
 on is the task of finding a basis of short and somewhat\northogonal vector
 s of a given lattice. In 1985 Lenstra\, Lenstra and\nLovasz proposed a pol
 ynomial time algorithm for this task\, with an\napplication to factoring r
 ational polynomials. Since then\, the LLL\nalgorithm has found countless a
 pplication in algorithmic number theory\nand in cryptanalysis.
DTSTAMP:20260402T170521Z
END:VEVENT
END:VCALENDAR