Follow
Mahdi Cheraghchi
Mahdi Cheraghchi
Associate Professor of Computer Science and Engineering, University of Michigan, Ann Arbor
Verified email at umich.edu - Homepage
Title
Cited by
Cited by
Year
Graph-constrained group testing
M Cheraghchi, A Karbasi, S Mohajer, V Saligrama
IEEE Transactions on Information Theory 58 (1), 248-262, 2012
1622012
Non-malleable coding against bit-wise and split-state tampering
M Cheraghchi, V Guruswami
Journal of Cryptology 30, 191-241, 2017
1352017
Restricted isometry of Fourier matrices and list decodability of random linear codes
M Cheraghchi, V Guruswami, A Velingker
SIAM Journal on Computing 42 (5), 1888-1914, 2013
1312013
Capacity of non-malleable codes
M Cheraghchi, V Guruswami
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
1092014
Coded trace reconstruction
M Cheraghchi, R Gabrys, O Milenkovic, J Ribeiro
IEEE Transactions on Information Theory 66 (10), 6084-6103, 2020
922020
Invertible extractors and wiretap protocols
M Cheraghchi, F Didier, A Shokrollahi
IEEE Transactions on Information Theory 58 (2), 1254-1274, 2011
692011
Group testing with probabilistic tests: Theory, design and application
M Cheraghchi, A Hormati, A Karbasi, M Vetterli
IEEE Transactions on Information Theory 57 (10), 7057-7067, 2011
672011
Submodular functions are noise stable
M Cheraghchi, A Klivans, P Kothari, HK Lee
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
572012
Noise-resilient group testing: Limitations and constructions
M Cheraghchi
Discrete Applied Mathematics 161 (1-2), 81-95, 2013
532013
Noise-resilient group testing: Limitations and constructions
M Cheraghchi
Fundamentals of Computation Theory, 62-73, 2009
532009
An overview of capacity results for synchronization channels
M Cheraghchi, J Ribeiro
IEEE Transactions on Information Theory 67 (6), 3207-3232, 2020
432020
Capacity upper bounds for deletion-type channels
M Cheraghchi
Journal of the ACM (JACM) 66 (2), 1-79, 2019
432019
Nearly optimal robust secret sharing
M Cheraghchi
Designs, Codes and Cryptography 87, 1777-1796, 2019
412019
Improved constructions for non-adaptive threshold group testing
M Cheraghchi
Algorithmica 67, 384-417, 2013
412013
Combinatorial group testing and sparse recovery schemes with near-optimal decoding time
M Cheraghchi, V Nakos
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
282020
Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
M Cheraghchi, P Indyk
ACM Transactions on Algorithms (TALG) 13 (3), 1-36, 2017
282017
Efficiently decodable non-adaptive threshold group testing
TV Bui, M Kuribayashi, M Cheraghchi, I Echizen
IEEE Transactions on Information Theory 65 (9), 5519-5528, 2019
242019
Circuit lower bounds for MCSP from local pseudorandom generators
M Cheraghchi, V Kabanets, Z Lu, D Myrisiotis
ACM Transactions on Computation Theory (TOCT) 12 (3), 1-27, 2020
232020
AC0∘ MOD2 lower bounds for the Boolean Inner Product
M Cheraghchi, E Grigorescu, B Juba, K Wimmer, N Xie
Journal of Computer and System Sciences 97, 45-59, 2018
232018
Improved constructions for non-adaptive threshold group testing
M Cheraghchi
Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010
232010
The system can't perform the operation now. Try again later.
Articles 1–20