Skip to content Skip to navigation
Computer Science Department Colloquium
10/25/2017 11:00 am
CoRE A 301

Towards Optimal Randomness Extractors and Ramsey Graphs

Eshan Chattopadhyay, Institute for Advanced Study

Faculty Host: Rutgers/DIMACS Theory of Computing


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.