An Explicit VC-Theorem for Low-Degree Polynomials. - Eshan Chattopadhyay; Adam R. Klivans; Pravesh Kothari (Electron. Colloquium Comput. Complex., 2012)

On Low Discrepancy Samplings in Product Spaces of Motion Groups. - Chandrajit L. Bajaj; Abhishek Bhowmick 001; Eshan Chattopadhyay; David Zuckerman (CoRR, 2014)

Non-Malleable Codes Against Constant Split-State Tampering. - Eshan Chattopadhyay; David Zuckerman (Electron. Colloquium Comput. Complex., 2014)

Non-Malleable Extractors and Codes, with their Many Tampered Extensions. - Eshan Chattopadhyay; Vipul Goyal; Xin Li 006 (Electron. Colloquium Comput. Complex., 2015)

Extractors for Sumset Sources. - Eshan Chattopadhyay; Xin Li 006 (Electron. Colloquium Comput. Complex., 2015)

Explicit Two-Source Extractors and Resilient Functions. - Eshan Chattopadhyay; David Zuckerman (Electron. Colloquium Comput. Complex., 2015)

New Extractors for Interleaved Sources. - Eshan Chattopadhyay; David Zuckerman (Electron. Colloquium Comput. Complex., 2015)

Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols. - Eshan Chattopadhyay; Xin Li 006 (Electron. Colloquium Comput. Complex., 2016)

Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions. - Eshan Chattopadhyay; Xin Li 006 (Electron. Colloquium Comput. Complex., 2016)

A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate. - Avraham Ben-Aroya; Eshan Chattopadhyay; Dean Doron; Xin Li 006; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2017)

Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity. - Eshan Chattopadhyay; Pooya Hatami; Omer Reingold; Avishay Tal (Electron. Colloquium Comput. Complex., 2017)

A New Approach for Constructing Low-Error, Two-Source Extractors. - Avraham Ben-Aroya; Eshan Chattopadhyay; Dean Doron; Xin Li 006; Amnon Ta-Shma (CCC, 2018)

Simple and efficient pseudorandom generators from Gaussian processes. - Eshan Chattopadhyay; Anindya De; Rocco A. Servedio (Electron. Colloquium Comput. Complex., 2018)

Pseudorandom Generators from Polarizing Random Walks. - Eshan Chattopadhyay; Pooya Hatami; Kaave Hosseini; Shachar Lovett (Electron. Colloquium Comput. Complex., 2018)

Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates. - Eshan Chattopadhyay; Pooya Hatami; Shachar Lovett; Avishay Tal (Electron. Colloquium Comput. Complex., 2018)

Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More. - Eshan Chattopadhyay; Xin Li 006 (Electron. Colloquium Comput. Complex., 2018)

Privacy Amplification from Non-malleable Codes. - Eshan Chattopadhyay; Bhavana Kanukurthi; Sai Lakshmi Bhavana Obbattu; Sruthi Sekar (IACR Cryptol. ePrint Arch., 2018)

Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More. - Eshan Chattopadhyay; Xin Li 006 (IACR Cryptol. ePrint Arch., 2018)

Extractors for Adversarial Sources via Extremal Hypergraphs. - Eshan Chattopadhyay; Jesse Goodman; Vipul Goyal; Xin Li 006 (Electron. Colloquium Comput. Complex., 2019)

XOR Lemmas for Resilient Functions Against Polynomials. - Eshan Chattopadhyay; Pooya Hatami; Kaave Hosseini; Shachar Lovett; David Zuckerman (Electron. Colloquium Comput. Complex., 2019)

Extractors and Secret Sharing Against Bounded Collusion Protocols. - Eshan Chattopadhyay; Jesse Goodman; Vipul Goyal; Ashutosh Kumar 002; Xin Li 006; Raghu Meka; David Zuckerman (FOCS, 2020)

Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering. - Eshan Chattopadhyay; Xin Li 006 (TCC (3), 2020)

Non-Malleability against Polynomial Tampering. - Marshall Ball; Eshan Chattopadhyay; Jyun-Jie Liao; Tal Malkin; Li-Yang Tan (Electron. Colloquium Comput. Complex., 2020)

Explicit Extremal Designs and Applications to Extractors. - Eshan Chattopadhyay; Jesse Goodman (Electron. Colloquium Comput. Complex., 2020)

Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols. - Eshan Chattopadhyay; Jesse Goodman; Vipul Goyal; Xin Li 006 (Electron. Colloquium Comput. Complex., 2020)

Fractional Pseudorandom Generators from the $k$th Fourier Level. - Eshan Chattopadhyay; Jason Gaitonde; Abhishek Shetty (Electron. Colloquium Comput. Complex., 2020)

Optimal Error Pseudodistributions for Read-Once Branching Programs. - Eshan Chattopadhyay; Jyun-Jie Liao (Electron. Colloquium Comput. Complex., 2020)

Nonmalleable Extractors and Codes, with Their Many Tampered Extensions. - Eshan Chattopadhyay; Vipul Goyal; Xin Li 006 (SIAM J. Comput., 2020)

Guest Column: A Recipe for Constructing Two-Source Extractors. - Eshan Chattopadhyay (SIGACT News, 2020)

Fractional Pseudorandom Generators from Any Fourier Level. - Eshan Chattopadhyay; Jason Gaitonde; Chin Ho Lee; Shachar Lovett; Abhishek Shetty (CCC, 2021)

Improved Extractors for Small-Space Sources. - Eshan Chattopadhyay; Jesse Goodman (FOCS, 2021)

Affine Extractors for Almost Logarithmic Entropy. - Eshan Chattopadhyay; Jesse Goodman; Jyun-Jie Liao (Electron. Colloquium Comput. Complex., 2021)

The Space Complexity of Sampling. - Eshan Chattopadhyay; Jesse Goodman; David Zuckerman (Electron. Colloquium Comput. Complex., 2021)

Extractors for Sum of Two Sources. - Eshan Chattopadhyay; Jyun-Jie Liao (Electron. Colloquium Comput. Complex., 2021)

Low-Degree Polynomials Extract from Local Sources. - Omar Alrabiah; Eshan Chattopadhyay; Jesse Goodman; Xin Li 006; João Ribeiro 002 (Electron. Colloquium Comput. Complex., 2022)

Hardness against Linear Branching Programs and More. - Eshan Chattopadhyay; Jyun-Jie Liao (Electron. Colloquium Comput. Complex., 2022)

Recent Advances in Randomness Extraction. - Eshan Chattopadhyay (Entropy, 2022)

Extractors for Polynomial Sources over $ mathbb{F}_2$. - Eshan Chattopadhyay; Jesse Goodman; Mohit Gurumukhani (Electron. Colloquium Comput. Complex., 2023)

On the Existence of Seedless Condensers: Exploring the Terrain. - Eshan Chattopadhyay; Mohit Gurumukhani; Noam Ringach (Electron. Colloquium Comput. Complex., 2023)

Recursive Error Reduction for Regular Branching Programs. - Eshan Chattopadhyay; Jyun-Jie Liao (Electron. Colloquium Comput. Complex., 2023)

Extractors for Polynomial Sources over 𝔽2. - Eshan Chattopadhyay; Jesse Goodman; Mohit Gurumukhani (ITCS, 2024)

Two-Sided Lossless Expanders in the Unbalanced Setting. - Eshan Chattopadhyay; Mohit Gurumukhani; Noam Ringach; Yunya Zhao (Electron. Colloquium Comput. Complex., 2024)

Condensing against Online Adversaries. - Eshan Chattopadhyay; Mohit Gurumukhani; Noam Ringach (Electron. Colloquium Comput. Complex., 2024)

Leakage-Resilient Extractors against Number-on-Forehead Protocols. - Eshan Chattopadhyay; Jesse Goodman (Electron. Colloquium Comput. Complex., 2025)

Lower Bounds for Leader Election and Collective Coin Flipping, Revisited. - Eshan Chattopadhyay; Mohit Gurumukhani; Noam Ringach; Rocco A. Servedio (CoRR, 2025)