BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
UID:159921
DTSTAMP:20240318T132719Z
DTSTART;TZID=America/New_York:20240322T120000
DTEND;TZID=America/New_York:20240322T130000
URL;TYPE=URI:https://www.wpi.edu/news/calendar/events/mathematical-sciences
 -department-discrete-math-seminar-mason-dicicco-wpi-communication-complexi
 ty
SUMMARY:Mathematical Sciences Department Discrete Math Seminar - Mason Dici
 cco, WPI "Communication Complexity and Linear Arrangements" (OH 109)
DESCRIPTION:Title: Communication Complexity and Linear Arrangements\nAbstra
 ct: A communication protocol is an algorithm for two parties to compute a 
 shared (Boolean) function when the input is split between them. Today I wi
 ll prove a theorem of Forster et al. that randomized, unbounded error comm
 unication protocols have the exact same expressive capabilities as linear 
 arrangements - a method of encoding functions by intersections of homogene
 ous half-spaces.\nFriday, March 22nd, 2024\n12:00 AM-12:50 AM\nOlin Hall R
 oom 109\n
END:VEVENT
END:VCALENDAR