I am broadly interested in theoretical computer science and I am part of the theory group at Cornell.
Before this I was a postdoctoral researcher at the Institute for Advanced Study with Avi Wigderson, a Microsoft Research Fellow at the Simons Institute, and a graduate student at UT Austin under David Zuckerman.

Here is a CV.

Below are some of my paper. Click here to find a complete list.

Selected Publications

  • Pseudorandom Generators from Polarizing Random Walks
    Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
    CCC 2018, Invited to ToC special issue
  • Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity
    Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal
    STOC 2018
  • Explicit Two-Source Extractors and Resilient Functions
    Eshan Chattopadhyay, David Zuckerman
    Annals of Mathematics 2019
    Preliminary version in STOC 2016, won Best Paper Award
  • Non-Malleable Extractors and Codes, with their Many Tampered Extensions
    Eshan Chattopadhyay, Vipul Goyal, Xin Li
    STOC 2016
  • PhD Thesis: Explicit Two-Source Extractors and More
    Awarded the Bert Kay Dissertation Award (best doctoral thesis in computer science at UT Austin)

    Program Committees: FSTTCS 2017, FOCS 2018

    Organizational Activities: Randomness Extractors: Constructions and Applications

    General audience article: How random is your randomness, and why does it matter?
    with David Zuckerman.

    • Introduction to analysis of algorithms: Spring 19 (co-taught with Bobby Kleinberg)
    • Pseudorandomness and Combinatorial Constructions: Fall 18, Fall 19