CS Events Monthly View

Computer Science Department Colloquium

Towards Optimal Randomness Extractors and Ramsey Graphs

 

Download as iCal file

Wednesday, October 25, 2017, 11:00am

 

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

Bio

NULL

Location : CoRE A 301

Committee

Rutgers/DIMACS Theory of Computing

Event Type: Computer Science Department Colloquium

Abstract: 

Organization

Institute for Advanced Study