I'm a Lecturer (Assistant Professor) in the Department of Computing. Previously, I have been a Qualcomm Research Fellowat the Simons Institute for the Theory of Computing of U.C. Berkeley and have held post-doctoral researcher positions at the MIT Computer Science and Artificial Intelligence Lab (hosted by Piotr Indyk), Computer Science Department of the Carnegie Mellon University (hosted by Venkat Guruswami) and the University of Texas at Austin (hosted by David Zuckerman).
I'm mainly interested in Theoretical Computer Science, or more specifically:
- Interconnections between electrical engineering and theoretical computer science (particularly coding and information theory and signal processing),
- Sparse recovery (e.g., compressive sensing and combinatorial group testing) and high-dimensional geometry,
- Information-theoretic privacy and security,
- The use of randomness in computation, and how to do things equally well without using randomness,
- Approximation algorithms and hardness of approximation.
Cheraghchi M, 2018, Nearly optimal robust secret sharing, Designs, Codes and Cryptography, ISSN:0925-1022
et al., 2018, AC(0) circle MOD(2 )lower bounds for the boolean inner product, Journal of Computer and System Sciences, Vol:97, ISSN:0022-0000, Pages:45-59
Cheraghchi Bashi Astaneh M, Capacity upper bounds for deletion-type channels, Journal of the Association for Computing Machinery (acm), ISSN:0004-5411
et al., 2018, Efficiently decodable non-adaptive threshold group testing, IEEE International Symposium on Information Theory (ISIT), IEEE, Pages:2584-2588, ISSN:2157-8095
Cheraghchi M, Ribeiro J, 2018, Improved capacity upper bounds for the discrete-time poisson channel, IEEE International Symposium on Information Theory (ISIT), IEEE, Pages:1769-1773, ISSN:2157-8095