Mahdi Cheraghchi

Cited by

	All	Since 2016
Citations	991	624
h-index	16	14
i10-index	24	18

180

135

200820092010201120122013201420152016201720182019202020213 4 15 25 32 88 93 88 92 93 104 168 163 4

Co-authors

Venkatesan GuruswamiCarnegie Mellon UniversityVerified email at cmu.edu
João L RibeiroPhD student, Imperial College LondonVerified email at imperial.ac.uk
Amin ShokrollahiEPFLVerified email at epfl.ch
Amin KarbasiYale UniversityVerified email at yale.edu
Thach V. BuiPostdoc at the University of Padova, Padova, ItalyVerified email at fit.hcmus.edu.vn
Isao EchizenNational Institute of Informatics / University of Tokyo / SOKENDAIVerified email at nii.ac.jp
FUCHUN LINPostdoc at University of CalgaryVerified email at e.ntu.edu.sg
Reihaneh Safavi -NainiUniversity of CalgaryVerified email at ucalgary.ca
Minoru KuribayashiOkayama UniversityVerified email at okayama-u.ac.jp
martin vetterliProfessor of computer and communication science, Ecole Polytechnique Federale LausanneVerified email at epfl.ch
Elena GrigorescuPurdue UniversityVerified email at purdue.edu
Venkatesh SaligramaProfessor, Electrical and Computer Engineering, Boston UniversityVerified email at bu.edu
Soheil MohajerUniversity of MinnesotaVerified email at umn.edu
Ameya Velingker | अमेय वेलिंगकरResearch Scientist, Google ResearchVerified email at google.com
Huaxiong WangNanyang Technological University, SingaporeVerified email at ntu.edu.sg
Pravesh K. KothariCarnegie Mellon UniversityVerified email at cs.cmu.edu
Homin K. LeeDatadogVerified email at columbia.edu
Adam KlivansProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
Brendan JubaAssistant Professor, Washington University in St. LouisVerified email at wustl.edu
Karl WimmerAssociate Professor of Mathematics, Duquesne UniversityVerified email at duq.edu

Mahdi Cheraghchi

University of Michigan, Ann Arbor

Verified email at umich.edu - Homepage

Theoretical Computer Science Applied Mathematics Combinatorics Complexity Theory Coding Theory


Title Sort by citations Sort by year Sort by 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	107	2012
Graph-constrained group testing M Cheraghchi, A Karbasi, S Mohajer, V Saligrama IEEE Transactions on Information Theory 58 (1), 248-262, 2012	107	2012
Non-malleable coding against bit-wise and split-state tampering M Cheraghchi, V Guruswami Theory of Cryptography Conference, 440-464, 2014	98	2014
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	98	2013
Capacity of non-malleable codes M Cheraghchi, V Guruswami Proceedings of the 5th conference on Innovations in theoretical computer …, 2014	75	2014
Invertible extractors and wiretap protocols M Cheraghchi, F Didier, A Shokrollahi IEEE Transactions on Information Theory 58 (2), 1254-1274, 2011	56	2011
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	56	2011
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	48	2012
Noise-resilient group testing: Limitations and constructions M Cheraghchi International Symposium on Fundamentals of Computation Theory, 62-73, 2009	46	2009
Noise-resilient group testing: Limitations and constructions M Cheraghchi Fundamentals of Computation Theory, 62-73, 2009	46	2009
Noise-resilient group testing: Limitations and constructions M Cheraghchi Discrete Applied Mathematics 161 (1-2), 81-95, 2013	38	2013
Improved constructions for non-adaptive threshold group testing M Cheraghchi Algorithmica 67 (3), 384-417, 2013	31	2013
Nearly optimal robust secret sharing M Cheraghchi Designs, Codes and Cryptography 87 (8), 1777-1796, 2019	21	2019
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	21	2009
Capacity upper bounds for deletion-type channels M Cheraghchi Journal of the ACM (JACM) 66 (2), 1-79, 2019	20	2019
Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform M Cheraghchi, P Indyk ACM Transactions on Algorithms (TALG) 13 (3), 1-36, 2017	20	2017
Improved constructions for non-adaptive threshold group testing M Cheraghchi International Colloquium on Automata, Languages, and Programming, 552-564, 2010	20	2010
Coded trace reconstruction M Cheraghchi, R Gabrys, O Milenkovic, J Ribeiro IEEE Transactions on Information Theory, 2020	19	2020
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	14	2019
Approximating linear threshold predicates M Cheraghchi, J Håstad, M Isaksson, O Svensson ACM Transactions on Computation Theory (TOCT) 4 (1), 1-31, 2012	14	2012

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors