BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Lattice Days
DTSTART;VALUE=DATE:20110217
DTSTAMP:20260429T121115Z
UID:1dc4ed95c673ad8073f8e7bc377ee618a7813729576e92a7afef664a
CATEGORIES:Conferences - Seminars
DESCRIPTION:THU - room CM010:\n14:00 - 14:45: Machine-efficient polynomial
  approximants (Nicolas Brisebarre) \n15:00 - 15:45: Covering cubes and clo
 sest vector (Martin Niemeier) \n16:30 - 17:15: Security of NTRUEncrypt (Da
 mien Stehle) \nFRI - room MA A1 12:\n9:30 - 10:15 : Enumerative Algorithms
  for the Shortest and Closest Lattice Vector Problems in Any Norm via M-El
 lipsoid Coverings (Daniel Dadush)\n10:30 - 11:30: L1 a new quasi-linear LL
 L algorithm (Andrew Novocin)\n13:30 - 14:15: Cutting planes for closest ve
 ctor (Niemeier & Bonifas) \n14:30 - 15:30: Analysis of the BKZ reduction a
 lgorithm (Xavier Pujol) \n16:30 - 17:15: Security of NTRUEncrypt (Damien S
 tehle) 
LOCATION:CM010 and MA A1 12
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR