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.

**Current students:** Jesse Goodman, Jyun-Jie Liao, Mohit Gurumukhani

I co-organize the Cornell CS theory seminar. Drop me a line if you are interested in giving a talk!

## Selected Publications

Eshan Chattopadhyay, Jyun-Jie Liao

54th Annual ACM Symposium on Theory of Computing (STOC), 2022

Eshan Chattopadhyay, Jesse Goodman, David Zuckerman

13th Innovations in Theoretical Computer Science (ITCS) conference, 2022

Eshan Chattopadhyay, Jesse Goodman

62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2021

Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty

35th Computational Complexity Conference (CCC), 2021

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)

Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman

52nd Annual ACM Symposium on Theory of Computing (STOC), 2020

Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett

Theory of Computing 2019. In Special Issue of 32nd Computational Complexity Confererence (CCC), 2018

Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal

50th Annual ACM Symposium on Theory of Computing (STOC), 2018

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

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)

**Funding: ** NSF CAREER Award, NSF CRII

** Program Committees:** FSTTCS 2017, FOCS 2018, RANDOM 2020 ,
CCC 2022 , ITC 2022

** Organizational Activities:** Co-organizer of the workshop titled *Randomness Extractors: Constructions and Applications * in STOC 2018.

**Teaching**

- CS 6815: Pseudorandomness and Combinatorial Constructions. Fall 2018, Fall 2019, Fall 2022
- CS 4820: Introduction to analysis of algorithms. Spring 2019 (co-taught with Bobby Kleinberg), Spring 2022
- CS 6810: Theory of Computing. Fall 2021
- CS 4814: Introduction to Computational Complexity. Spring 2020, Spring 2021
- CS 6817: Analysis of Boolean Functions. Fall 2020
- CSMore Program: Summer 2020 , Summer 2021 . Short introduction to Discrete Structures (pre-2800), co-taught with Éva Tardos.