BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20181104T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20191103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20191125T150000
DTEND;TZID=America/New_York:20191125T160000
DTSTAMP:20240212T095530Z
CREATED:20240212T095530Z
LAST-MODIFIED:20240212T095530Z
UID:10001943-1574694000-1574697600@cmsa.fas.harvard.edu
SUMMARY:11/25/2019 Math Physics Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/11-25-2019-math-physics-seminar/
LOCATION:MA
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20191125T163000
DTEND;TZID=America/New_York:20191125T173000
DTSTAMP:20240514T173609Z
CREATED:20240212T094946Z
LAST-MODIFIED:20240514T173609Z
UID:10001934-1574699400-1574703000@cmsa.fas.harvard.edu
SUMMARY:Communication Complexity of Randomness Manipulation
DESCRIPTION:Speaker: Madhu Sudan (Harvard)\n\nTitle: Communication Complexity of Randomness Manipulation\n\nAbstract: The task of manipulating randomness has been a subject of intense investigation in the theory of computer science. The classical definition of this task consider a single processor massaging random samples from an unknown source and trying to convert it into a sequence of uniform independent bits.  In this talk I will talk about a less studied setting where randomness is distributed among different players who would like to convert this randomness to others forms with relatively little communication. For instance players may be given access to a source of biased correlated bits\, and their goal may be to get a common random bit out of this source. Even in the setting where the source is known this can lead to some interesting questions that have been explored since the 70s with striking constructions and some surprisingly hard questions. After giving some background\, I will describe a recent work which explores the task of extracting common randomness from correlated sources with bounds on the number of rounds of interaction. Based on joint works with Mitali Bafna (Harvard)\, Badih Ghazi (Google) and Noah Golowich (Harvard).
URL:https://cmsa.fas.harvard.edu/event/11-25-2019-colloquium/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-11.25.19.png
END:VEVENT
END:VCALENDAR