Dr Mahdi Cheraghchi is an Honorary Senior Lecturer at the Department of Computing, and also on the faculty of the EECS Department at the University of Michigan, Ann Arbor. Previously, he has been a Qualcomm Research Fellow at 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).
Dr Cheraghchi is 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.
Cheraghchi M, 2019, Nearly optimal robust secret sharing, Designs, Codes and Cryptography, Vol:87, ISSN:0925-1022, Pages:1777-1796
Cheraghchi M, 2019, Expressions for the Entropy of Basic Discrete Distributions, Ieee Transactions on Information Theory, Vol:65, ISSN:0018-9448, Pages:3999-4009
Cheraghchi Bashi Astaneh M, 2019, Capacity upper bounds for deletion-type channels, Journal of the Association for Computing Machinery (acm), Vol:66, ISSN:0004-5411, Pages:1-17
Cheraghchi M, Ribeiro J, 2019, Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, Pages:4052-4068, ISSN:0018-9448