Skip to content Skip to navigation

Rutgers University, Computer Science Department Colloquium: Towards Optimal Randomness Extractors and Ramsey Graphs

Abstract: 

I will survey some of the recent exciting progress on explicit constructions of randomness extractors for independent sources. Many of the new constructions rely on explicit constructions of newly introduced pseudorandom primitives, and there remains scope of finding better explicit constructions of these primitives. I will also discuss some possible approaches for constructing optimal Ramsey graphs and Extractors.

Speaker: 
Eshan Chattopadhyay
Location: 
CoRE A 301
Event Date: 
10/25/2017 - 11:00am
Committee: 
Rutgers/DIMACS Theory of Computing
Event Type: 
Rutgers University, Computer Science Department Colloquium
Organization: 
Institute for Advanced Study