Mahdi Cheraghchi

ScholarGPS® ID: 13977869567461

Affiliation

University of Michigan, Ann Arbor, United States

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Information Theory | Control Theory | Compressed Sensing | Cryptography | Discrete Mathematics

Metrics Summary

Publication Count

Predicted Citations

1,192

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Semi-quantitative group testing for efficient and accurate qPCR screening of pathogens with a wide range of loads (journal article) Nambiar, Ananthan \| Pan, Chao \| Rana, Vishal \| Cheraghchi, Mahdi \| Ribeiro, João \| Maslov, Sergei \| Milenkovic, Olgica BMC Bioinformatics, volume 25, issue 1 (2024). 10.1186/s12859-024-05798-3 Cite \| Source
Simple Codes and Sparse Recovery with Fast Decoding (journal article) Cheraghchi, Mahdi \| Ribeiro, João SIAM Journal on Discrete Mathematics, volume 37, issue 2, pages 612-631 (2023). 10.1137/21M1465354 Cite \| Source
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓ Norms (conference) Bennett, Huck \| Cheraghchi, Mahdi \| Guruswami, Venkatesan \| Ribeiro, João STOC '23: 55th Annual ACM Symposium on Theory of Computing (2023) Orlando FL USA 10.1145/3564246.3585214 Cited by (1) \| Cite \| Source
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP (journal article) Cheraghchi, Mahdi \| Hirahara, Shuichi \| Myrisiotis, Dimitrios \| Yoshida, Yuichi Theory of Computing Systems (2022). 10.1007/s00224-022-10113-9 Cite \| Source
Mean-Based Trace Reconstruction Over Oblivious Synchronization Channels (journal article) Cheraghchi, Mahdi \| Downs, Joseph \| Ribeiro, Joao \| Veliche, Alexandra IEEE Transactions on Information Theory, volume 68, issue 7, pages 4272-4281 (2022). 10.1109/TIT.2022.3157383 Cite \| Source
Non-Asymptotic Capacity Upper Bounds for the Discrete-Time Poisson Channel With Positive Dark Current (journal article) Cheraghchi, Mahdi \| Ribeiro, Joao IEEE Communications Letters, volume 25, issue 12, pages 3829-3832 (2021). 10.1109/LCOMM.2021.3120706 Cited by (1) \| Cite \| Source
Improved Non-Adaptive Algorithms for Threshold Group Testing With a Gap (journal article) Bui, Thach V. \| Cheraghchi, Mahdi \| Echizen, Isao IEEE Transactions on Information Theory, volume 67, issue 11, pages 7180-7196 (2021). 10.1109/TIT.2021.3104670 Cited by (2) \| Cite \| Source
Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel (conference) Cheraghchi, Mahdi \| Downs, Joseph \| Ribeiro, Joao \| Veliche, Alexandra 2021 IEEE International Symposium on Information Theory (ISIT) (2021) Melbourne, Australia 10.1109/ISIT45174.2021.9518161 Cited by (3) \| Cite \| Source
Improved algorithms for non-adaptive group testing with consecutive positives (conference) Bui, Thach V. \| Cheraghchi, Mahdi \| Nguyen, Thuc D. 2021 IEEE International Symposium on Information Theory (ISIT) (2021) Melbourne, Australia 10.1109/ISIT45174.2021.9518277 Cited by (6) \| Cite \| Source
Semiquantitative Group Testing in at Most Two Rounds (conference) Cheraghchi, Mahdi \| Gabrys, Ryan \| Milenkovic, Olgica 2021 IEEE International Symposium on Information Theory (ISIT) (2021) Melbourne, Australia 10.1109/ISIT45174.2021.9518270 Cited by (4) \| Cite \| Source
An Overview of Capacity Results for Synchronization Channels (journal article) Cheraghchi, Mahdi \| Ribeiro, Joao IEEE Transactions on Information Theory, volume 67, issue 6, pages 3207-3232 (2021). 10.1109/TIT.2020.2997329 Cited by (24) \| Cite \| Source
Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time (conference) Cheraghchi, Mahdi \| Nakos, Vasileios 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020) Durham, NC, USA 10.1109/FOCS46700.2020.00115 Cited by (9) \| Cite \| Source
Coded Trace Reconstruction (journal article) Cheraghchi, Mahdi \| Gabrys, Ryan \| Milenkovic, Olgica \| Ribeiro, Joao IEEE Transactions on Information Theory, volume 66, issue 10, pages 6084-6103 (2020). 10.1109/TIT.2020.2996377 Cited by (42) \| Cite \| Source
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators (journal article) Cheraghchi, Mahdi \| Kabanets, Valentine \| Lu, Zhenjian \| Myrisiotis, Dimitrios ACM Transactions on Computation Theory, volume 12, issue 3, pages 1-27 (2020). 10.1145/3404860 Cited by (3) \| Cite \| Source
Improved non-adaptive algorithms for threshold group testing with a gap (conference) Bui, Thach V. \| Cheraghchi, Mahdi \| Echizen, Isao 2020 IEEE International Symposium on Information Theory (ISIT) (2020) Los Angeles, CA, USA 10.1109/ISIT44484.2020.9174212 Cited by (2) \| Cite \| Source
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels (journal article) Cheraghchi, Mahdi \| Ribeiro, Joao IEEE Transactions on Information Theory, volume 65, issue 11, pages 6950-6974 (2019). 10.1109/TIT.2019.2920375 Cited by (6) \| Cite \| Source
Efficiently Decodable Non-Adaptive Threshold Group Testing (journal article) Bui, Thach V. \| Kuribayashi, Minoru \| Cheraghchi, Mahdi \| Echizen, Isao IEEE Transactions on Information Theory, volume 65, issue 9, pages 5519-5528 (2019). 10.1109/TIT.2019.2907990 Cited by (11) \| Cite \| Source
Nearly optimal robust secret sharing (journal article) Cheraghchi, Mahdi Designs, Codes and Cryptography, volume 87, issue 8, pages 1777-1796 (2019). 10.1007/s10623-018-0578-y Cited by (8) \| Cite \| Source
Coded Trace Reconstruction (conference) Cheraghchi, Mahdi \| Ribeiro, Joao \| Gabrys, Ryan \| Milenkovic, Olgica 2019 IEEE Information Theory Workshop (ITW) (2019) Visby, Sweden 10.1109/ITW44776.2019.8989261 Cited by (11) \| Cite \| Source
Non-Malleable Codes against Active Physical Layer Adversary (conference) Lin, Fuchun \| Safavi-Naini, Reihaneh \| Cheraghchi, Mahdi \| Wang, Huaxiong 2019 IEEE International Symposium on Information Theory (ISIT) (2019) Paris, France 10.1109/ISIT.2019.8849438 Cited by (1) \| Cite \| Source