Mahdi Cheraghchi
TitleCited byYear
Graph-constrained group testing
M Cheraghchi, A Karbasi, S Mohajer, V Saligrama
IEEE Transactions on Information Theory 58 (1), 248-262, 2012
922012
Graph-constrained group testing
M Cheraghchi, A Karbasi, S Mohajer, V Saligrama
IEEE Transactions on Information Theory 58 (1), 248-262, 2012
922012
Non-malleable coding against bit-wise and split-state tampering
M Cheraghchi, V Guruswami
Theory of Cryptography Conference, 440-464, 2014
802014
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
762013
Capacity of non-malleable codes
M Cheraghchi, V Guruswami
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
662014
Invertible extractors and wiretap protocols
M Cheraghchi, F Didier, A Shokrollahi
IEEE Transactions on Information Theory 58 (2), 1254-1274, 2011
512011
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
512011
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
452012
Noise-resilient group testing: Limitations and constructions
M Cheraghchi
International Symposium on Fundamentals of Computation Theory, 62-73, 2009
372009
Noise-resilient group testing: Limitations and constructions
M Cheraghchi
Fundamentals of Computation Theory, 62-73, 2009
372009
Noise-resilient group testing: Limitations and constructions
M Cheraghchi
Discrete Applied Mathematics 161 (1-2), 81-95, 2013
352013
Improved constructions for non-adaptive threshold group testing
M Cheraghchi
Algorithmica 67 (3), 384-417, 2013
272013
Compressed sensing with probabilistic measurements: A group testing solution
M Cheraghchi, A Hormati, A Karbasi, M Vetterli
2009 47th Annual Allerton Conference on Communication, Control, and …, 2009
222009
Improved constructions for non-adaptive threshold group testing
M Cheraghchi
International Colloquium on Automata, Languages, and Programming, 552-564, 2010
202010
Approximating linear threshold predicates
M Cheraghchi, J Håstad, M Isaksson, O Svensson
ACM Transactions on Computation Theory (TOCT) 4 (1), 2, 2012
132012
Nearly optimal robust secret sharing
M Cheraghchi
Designs, Codes and Cryptography 87 (8), 1777-1796, 2019
122019
Capacity upper bounds for deletion-type channels
M Cheraghchi
Journal of the ACM (JACM) 66 (2), 9, 2019
122019
Bit precision analysis for compressed sensing
E Ardestanizadeh, M Cheraghchi, A Shokrollahi
2009 IEEE International Symposium on Information Theory, 1-5, 2009
122009
Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
M Cheraghchi, P Indyk
ACM Transactions on Algorithms (TALG) 13 (3), 34, 2017
112017
Coding-theoretic methods for sparse recovery
M Cheraghchi
2011 49th Annual Allerton Conference on Communication, Control, and …, 2011
92011
The system can't perform the operation now. Try again later.
Articles 1–20