Scholar
Eshan Chattopadhyay
Google Scholar ID: 5ReVSa8AAAAJ
Associate Professor at Cornell University
Complexity Theory
Randomness in Computation
Cryptography
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
1,080
H-index
17
i10-index
23
Publications
20
Co-authors
23
list available
Publications
8 items
Two-Sided Product Expanding Codes via Rademacher Matrices
2026
Cited
0
Frustration Free Stoquastic Local Hamiltonian with Sub-Constant Gap is in NP
2026
Cited
0
Exponential Correlation Bounds for Polynomials
2026
Cited
0
A Resolution of Friedgut's Conjecture on Influential Coalitions
2026
Cited
0
Leakage-Resilient Extractors against Number-on-Forehead Protocols
Symposium on the Theory of Computing · 2025
Cited
1
Lower Bounds for Leader Election and Collective Coin Flipping, Revisited
2025
Cited
0
Condensing and Extracting Against Online Adversaries
2024
Cited
1
Two-Sided Lossless Expanders in the Unbalanced Setting
Electron. Colloquium Comput. Complex. · 2024
Cited
2
Co-authors
16 total
Xin Li
Johns Hopkins University
David Zuckerman
Professor of Computer Science, University of Texas at Austin
Jesse Goodman
The University of Texas at Austin
Shachar Lovett
Full Professor of Computer Science, University of California San Diego
Pooya Hatami
The Ohio State University
Vipul Goyal
NTT Research
Avishay Tal
UC Berkeley
Omer Reingold
Stanford University
