| Graph-constrained group testing M Cheraghchi, A Karbasi, S Mohajer, V Saligrama IEEE Transactions on Information Theory 58 (1), 248-262, 2012 | 178 | 2012 |
| Non-malleable coding against bit-wise and split-state tampering M Cheraghchi, V Guruswami Journal of Cryptology 30 (1), 191-241, 2017 | 144 | 2017 |
| 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 | 133 | 2013 |
| Capacity of non-malleable codes M Cheraghchi, V Guruswami Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 118 | 2014 |
| Coded trace reconstruction M Cheraghchi, R Gabrys, O Milenkovic, J Ribeiro IEEE Transactions on Information Theory 66 (10), 6084-6103, 2020 | 112 | 2020 |
| Invertible extractors and wiretap protocols M Cheraghchi, F Didier, A Shokrollahi IEEE Transactions on Information Theory 58 (2), 1254-1274, 2011 | 79 | 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 | 74 | 2011 |
| An overview of capacity results for synchronization channels M Cheraghchi, J Ribeiro IEEE Transactions on Information Theory 67 (6), 3207-3232, 2020 | 63 | 2020 |
| Noise-resilient group testing: Limitations and constructions M Cheraghchi Discrete Applied Mathematics 161 (1-2), 81-95, 2013 | 59 | 2013 |
| 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 | 59 | 2012 |
| Noise-resilient group testing: Limitations and constructions M Cheraghchi Fundamentals of Computation Theory, 62-73, 2009 | 54 | 2009 |
| Capacity upper bounds for deletion-type channels M Cheraghchi Journal of the ACM (JACM) 66 (2), 1-79, 2019 | 49 | 2019 |
| 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 | 42 | 2020 |
| Nearly optimal robust secret sharing M Cheraghchi Designs, Codes and Cryptography 87 (8), 1777-1796, 2019 | 41 | 2019 |
| Improved constructions for non-adaptive threshold group testing M Cheraghchi Algorithmica 67 (3), 384-417, 2013 | 41 | 2013 |
| Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform M Cheraghchi, P Indyk ACM Transactions on Algorithms (TALG) 13 (3), 1-36, 2017 | 33 | 2017 |
| One-way functions and a conditional variant of MKTP E Allender, M Cheraghchi, D Myrisiotis, H Tirumala, I Volkovich Leibniz international proceedings in informatics 213, 2021 | 26 | 2021 |
| 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 | 26 | 2019 |
| 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 | 26 | 2018 |
| 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 | 25 | 2020 |
João RibeiroIT and Instituto Superior Técnico, Universidade de LisboaVerified email at tecnico.ulisboa.pt
