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:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6830bd5fd2269
DTSTART;TZID=America/Toronto:20220620T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220620T133000
URL:/computer-science/events/phd-defence-algorithms-com
 plexity-complexity-of-sublinear-algorithms-for-convexity-in-higher-dimensi
 ons
SUMMARY:PhD Defence • Algorithms and Complexity • Complexity of Subline
 ar\nAlgorithms for Convexity in Higher Dimensions
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS PHD DEFENCE WILL TAKE PLACE ONLIN
 E.\n\nVENKATA ABHINAV BOMMIREDDI\, PHD CANDIDATE\n_David R. Cheriton Schoo
 l of Computer Science_\n\nSUPERVISOR: Professor Eric Blais\n\nConvexity pl
 ays a prominent role in both mathematics and computer\nscience. It is defi
 ned for sets and functions\, and many problems\nrelated to them can be sol
 ved efficiently given the guarantee that the\nset/function is convex. In t
 his thesis\, we focus on three problems\nrelated to convexity where we don
 ’t have that guarantee.\n 
DTSTAMP:20250523T182431Z
END:VEVENT
END:VCALENDAR