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

Some press coverage of my research: BBC, Science News, and Communications of ACM.

Invited survey article: A Recipe for Constructing Two-Source Extractors
ACM SIGACT News Complexity Theory Column , June 2020 issue

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

Funding: Sloan Research Fellowship, NSF CAREER Award, NSF CRII

Current students:



Here is a CV and a brief bio.

I co-organize the Cornell CS theory seminar. Drop me a line if you are interested in giving a talk!
Below are some of my paper. Click here to find a complete list.

Selected Publications

  • Extractors for Sum of Two Sources
    Eshan Chattopadhyay, Jyun-Jie Liao
    54th Annual ACM Symposium on Theory of Computing (STOC), 2022
  • The Space Complexity of Sampling
    Eshan Chattopadhyay, Jesse Goodman, David Zuckerman
    13th Innovations in Theoretical Computer Science (ITCS) conference, 2022
  • Improved Extractors for Small-Space Sources
    Eshan Chattopadhyay, Jesse Goodman
    62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2021
  • Fractional Pseudorandom Generators from Any Fourier Level
    Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty
    36th Computational Complexity Conference (CCC), 2021
  • Extractors and Secret-Sharing against Bounded Collusion Protocols
    Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman
    61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2020 (merge of this paper and this paper)
  • XOR Lemmas for Resilient Functions Against Polynomials
    Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
    52nd Annual ACM Symposium on Theory of Computing (STOC), 2020
  • Pseudorandom Generators from Polarizing Random Walks
    Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
    Theory of Computing 2019. In Special Issue of 33rd Computational Complexity Confererence (CCC), 2018
  • Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity
    Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal
    50th Annual ACM Symposium on Theory of Computing (STOC), 2018
  • Explicit Two-Source Extractors and Resilient Functions
    Eshan Chattopadhyay, David Zuckerman
    Annals of Mathematics 2019
    Preliminary version in the 48th Annual ACM Symposium on Theory of Computing (STOC), 2016. Won Best Paper Award
  • Non-Malleable Extractors and Codes, with their Many Tampered Extensions
    Eshan Chattopadhyay, Vipul Goyal, Xin Li
    SIAM Journal on Computing (SICOMP) 2020.
    Preliminary version in the 48th Annual ACM Symposium on Theory of Computing (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, RANDOM 2020 , CCC 2022 , ITC 2022

    Some Organizational Activities

    Teaching