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:69dc6f8b3e79c
DTSTART;TZID=America/Toronto:20220620T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220620T133000
URL:https://uwaterloo.ca/computer-science/events/phd-defence-algorithms-com
 plexity-complexity-of-sublinear-algorithms-for-convexity-in-higher-dimensi
 ons
LOCATION:200 University Avenue West Online PhD defence Waterloo ON N2L 3G1 
 Canada
SUMMARY:PhD Defence • Algorithms and Complexity • Complexity of Subline
 ar\nAlgorithms for Convexity in Higher Dimensions
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS PHD DEFENCE WILL TAKE PLACE ONLINE.\n\nVENKAT
 A ABHINAV BOMMIREDDI\, PHD CANDIDATE\n_David R. Cheriton School of Compute
 r Science_\n\nSUPERVISOR: Professor Eric Blais\n\nConvexity plays a promin
 ent role in both mathematics and computer\nscience. It is defined for sets
  and functions\, and many problems\nrelated to them can be solved efficien
 tly given the guarantee that the\nset/function is convex. In this thesis\,
  we focus on three problems\nrelated to convexity where we don’t have th
 at guarantee.
DTSTAMP:20260413T042235Z
END:VEVENT
END:VCALENDAR