Mahdi Cheraghchi - Google Scholar Citations

Cited by

	All	Since 2014
Citations	772	601
h-index	13	12
i10-index	17	14

140

105

2008200920102011201220132014201520162017201820193 3 14 25 34 81 92 89 96 94 102 121

Co-authors

Venkatesan GuruswamiCarnegie Mellon UniversityVerified email at cmu.edu
Amin ShokrollahiEPFLVerified email at epfl.ch
Amin KarbasiYale UniversityVerified email at yale.edu
martin vetterliProfessor of computer and communication science, Ecole Polytechnique Federale LausanneVerified email at epfl.ch
João L RibeiroPhD student, Imperial College LondonVerified email at imperial.ac.uk
Minoru KuribayashiOkayama UniversityVerified email at okayama-u.ac.jp
Thach V. BuiPhD student at National Institute of Informatics, Tokyo JapanVerified email at fit.hcmus.edu.vn
Venkatesh SaligramaProfessor, Electrical and Computer Engineering, Boston UniversityVerified email at bu.edu
Soheil MohajerUniversity of MinnesotaVerified email at umn.edu
Ameya VelingkerCollaborateur Scientifique (Research Scientist)Verified email at epfl.ch
Pravesh K. KothariResearch Instructor, Princeton UniversityVerified email at cs.princeton.edu
Homin K. LeeDatadogVerified email at columbia.edu
Adam KlivansProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
Johan HåstadProfessor i teoretisk datalogi, KTHVerified email at kth.se
Ola SvenssonEPFLVerified email at epfl.ch
Elena GrigorescuPurdue UniversityVerified email at purdue.edu
FUCHUN LINPostdoc at University of CalgaryVerified email at e.ntu.edu.sg
Reihaneh Safavi -NainiUniversity of CalgaryVerified email at ucalgary.ca
Piotr IndykProfessor of Electrical Engineering and Computer Science, MITVerified email at mit.edu
Brendan JubaAssistant Professor, Washington University in St. LouisVerified email at wustl.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	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	92	2012
Graph-constrained group testing M Cheraghchi, A Karbasi, S Mohajer, V Saligrama IEEE Transactions on Information Theory 58 (1), 248-262, 2012	92	2012
Non-malleable coding against bit-wise and split-state tampering M Cheraghchi, V Guruswami Theory of Cryptography Conference, 440-464, 2014	80	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	76	2013
Capacity of non-malleable codes M Cheraghchi, V Guruswami Proceedings of the 5th conference on Innovations in theoretical computer …, 2014	66	2014
Invertible extractors and wiretap protocols M Cheraghchi, F Didier, A Shokrollahi IEEE Transactions on Information Theory 58 (2), 1254-1274, 2011	51	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	51	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	45	2012
Noise-resilient group testing: Limitations and constructions M Cheraghchi International Symposium on Fundamentals of Computation Theory, 62-73, 2009	37	2009
Noise-resilient group testing: Limitations and constructions M Cheraghchi Fundamentals of Computation Theory, 62-73, 2009	37	2009
Noise-resilient group testing: Limitations and constructions M Cheraghchi Discrete Applied Mathematics 161 (1-2), 81-95, 2013	35	2013
Improved constructions for non-adaptive threshold group testing M Cheraghchi Algorithmica 67 (3), 384-417, 2013	27	2013
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	22	2009
Improved constructions for non-adaptive threshold group testing M Cheraghchi International Colloquium on Automata, Languages, and Programming, 552-564, 2010	20	2010
Approximating linear threshold predicates M Cheraghchi, J Håstad, M Isaksson, O Svensson ACM Transactions on Computation Theory (TOCT) 4 (1), 2, 2012	13	2012
Nearly optimal robust secret sharing M Cheraghchi Designs, Codes and Cryptography 87 (8), 1777-1796, 2019	12	2019
Capacity upper bounds for deletion-type channels M Cheraghchi Journal of the ACM (JACM) 66 (2), 9, 2019	12	2019
Bit precision analysis for compressed sensing E Ardestanizadeh, M Cheraghchi, A Shokrollahi 2009 IEEE International Symposium on Information Theory, 1-5, 2009	12	2009
Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform M Cheraghchi, P Indyk ACM Transactions on Algorithms (TALG) 13 (3), 34, 2017	11	2017
Coding-theoretic methods for sparse recovery M Cheraghchi 2011 49th Annual Allerton Conference on Communication, Control, and …, 2011	9	2011

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