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:69d25753b674d
DTSTART;TZID=America/Toronto:20200826T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200826T100000
URL:https://uwaterloo.ca/computer-science/events/masters-thesis-presentatio
 n-algorithms-and-complexity-monotonicity-testing-for-boolean-functions-ove
 r-graph-products
LOCATION:200 University Avenue West Online presentation Waterloo ON N2L 3G1
  Canada
SUMMARY:Master’s Thesis Presentation • Algorithms and Complexity —\nM
 onotonicity Testing for Boolean Functions over Graph Products
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS MASTER’S THESIS PRESENTATION WILL BE GIVEN 
 ONLINE.\n\nZHENGKUN CHEN\, MASTER’S CANDIDATE\n_David R. Cheriton Schoo
 l of Computer Science_\n\nSUPERVISOR: Professor Eric Blais\n\nWe establish
  a directed analogue of Chung and Tetali’s isoperimetric\ninequality for
  graph products. We use this inequality to obtain new\nbounds on the query
  complexity for testing monotonicity of\nBoolean-valued functions over pro
 ducts of general posets.
DTSTAMP:20260405T123635Z
END:VEVENT
END:VCALENDAR