Eshan Chattopadhyay
Affiliations:- Cornell University, Ithaca, NY, USA
- Institute for Advanced Study, Princeton, School of Mathematics (former)
- University of California, Berkeley, Simons Institute (former)
- University of Texas at Austin, Department of Computer Science (former)
According to our database1,
Eshan Chattopadhyay
authored at least 42 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Electron. Colloquium Comput. Complex., 2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
2023
Electron. Colloquium Comput. Complex., 2023
Electron. Colloquium Comput. Complex., 2023
Electron. Colloquium Comput. Complex., 2023
2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
2021
Electron. Colloquium Comput. Complex., 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
Proceedings of the 36th Computational Complexity Conference, 2021
2020
SIAM J. Comput., 2020
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
Electron. Colloquium Comput. Complex., 2019
Electron. Colloquium Comput. Complex., 2019
2018
Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More.
IACR Cryptol. ePrint Arch., 2018
Electron. Colloquium Comput. Complex., 2018
Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates.
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Proceedings of the 33rd Computational Complexity Conference, 2018
2017
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity.
Electron. Colloquium Comput. Complex., 2017
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.
Electron. Colloquium Comput. Complex., 2017
2016
Electron. Colloquium Comput. Complex., 2016
Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols.
Electron. Colloquium Comput. Complex., 2016
2015
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
2014
Electron. Colloquium Comput. Complex., 2014
2012
Electron. Colloquium Comput. Complex., 2012