BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
BEGIN:VEVENT
CATEGORIES:Colloquium
DESCRIPTION:Abstract: \nRandomness is widely used in various areas of compu
ter science\, and many of the applications require uniform\, uncorrelated b
it. However\, most sources of randomness in nature are defective and at be
st\, only contain some amount of entropy. This leads to the area of randomn
ess extraction\, where an extractor is a deterministic procedure to produce
pure random bits from a weak source. A central open problem (from the 80s)
in this area is to extract from 2 independent weak sources (it is known th
at it is impossible to extract from just 1 weak source). In joint work with
David Zuckerman\, we resolve this problem. I will discuss ideas that we us
e to solve this problem.\n\nAs a corollary of our 2-source extractor\, we
obtain exponential improvements in explicit constructions of Ramsey graphs\
, a central object in extremal combinatorics. This is in a line of work spa
nning the last 70 years in an attempt to meet Erdos' challenge of matching
the probabilistic method.\n\n\nBio:\nEshan Chattopadhyay is an Assistant Pr
ofessor in the Computer Science Department at Cornell University. He receiv
ed an B.Tech. in Computer Science from Indian Institute of Technology Kanpu
r in 2011 and a Ph.D. in Computer Science from UT Austin in 2016. He was a
postdoctoral fellow at the Institute for Advanced Study\, Princeton from 2
016-2018\, and at a Microsoft Research Fellow at the Simons Institute for t
he Theory of Computing in the Spring of 2017.\n\nHis research focuses prima
rily on pseudorandomness and the role of randomness in computing. He is bes
t known for his work on randomness extractors and their applications. His o
ther research interests include complexity theory\, coding theory\, and cry
ptography. His research awards include a Best Paper Award at STOC 2016\, an
d the Bert Kay Dissertation Award 2016.
DTEND:20180831T203000Z
DTSTAMP:20190519T061938Z
DTSTART:20180831T193000Z
GEO:42.443451;-76.481506
LOCATION:Frank H. T. Rhodes Hall\, 655
SEQUENCE:0
SUMMARY:CAM Colloquium: Eshan Chattopadhyay (CS\, Cornell University) - E
xplicit Constructions of Ramsey Graphs and Randomness Extractors
UID:tag:localist.com\,2008:EventInstance_3791364
URL:http://events.cornell.edu/event/cam_colloquium_eshan_chattopadhyay_cs_c
ornell_university_-_explicit_constructions_of_ramsey_graphs_and_randomness_
extractors
END:VEVENT
END:VCALENDAR