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:20160313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20161106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e03536802c2
DTSTART;TZID=America/Toronto:20170201T114500
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20170201T114500
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/seminar-mat
 hieu-lauriere
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 1201 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Seminar: Mathieu Lauriere
CLASS:PUBLIC
DESCRIPTION:EXTENDED LEARNING GRAPHS FOR TRIANGLE FINDING\n\nMATHIEU LAURIE
 RE\, NEW YORK UNIVERSITY\, SHANGHAI\n\nIn this talk we present new quantu
 m algorithms for Triangle Finding\nimproving its best previously known qua
 ntum query complexities for\nboth dense and spare instances. For dense gra
 phs on n vertices\, we get\na query complexity of O(n^{5/4}) without any o
 f the extra logarithmic\nfactors present in the previous algorithm of Le G
 all [FOCS’14]. For\nsparse graphs we also improve some of the results ob
 tained by Le Gall\nand Nakajima [ISAAC’15].
DTSTAMP:20260416T010246Z
END:VEVENT
END:VCALENDAR