Sledovat
Mahdi Cheraghchi
Název
Citace
Citace
Rok
Graph-constrained group testing
M Cheraghchi, A Karbasi, S Mohajer, V Saligrama
IEEE Transactions on Information Theory 58 (1), 248-262, 2012
1382012
Graph-constrained group testing
M Cheraghchi, A Karbasi, S Mohajer, V Saligrama
IEEE Transactions on Information Theory 58 (1), 248-262, 2012
1382012
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
1142013
Non-malleable coding against bit-wise and split-state tampering
M Cheraghchi, V Guruswami
Theory of Cryptography Conference, 440-464, 2014
1032014
Capacity of non-malleable codes
M Cheraghchi, V Guruswami
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
822014
Invertible extractors and wiretap protocols
M Cheraghchi, F Didier, A Shokrollahi
IEEE Transactions on Information Theory 58 (2), 1254-1274, 2011
602011
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
602011
Coded trace reconstruction
M Cheraghchi, R Gabrys, O Milenkovic, J Ribeiro
IEEE Transactions on Information Theory 66 (10), 6084-6103, 2020
572020
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
532012
Noise-resilient group testing: Limitations and constructions
M Cheraghchi
International Symposium on Fundamentals of Computation Theory, 62-73, 2009
492009
Noise-resilient group testing: Limitations and constructions
M Cheraghchi
Fundamentals of Computation Theory, 62-73, 2009
492009
Noise-resilient group testing: Limitations and constructions
M Cheraghchi
Discrete Applied Mathematics 161 (1-2), 81-95, 2013
452013
Capacity upper bounds for deletion-type channels
M Cheraghchi
Journal of the ACM (JACM) 66 (2), 1-79, 2019
342019
Improved constructions for non-adaptive threshold group testing
M Cheraghchi
Algorithmica 67 (3), 384-417, 2013
342013
Nearly optimal robust secret sharing
M Cheraghchi
Designs, Codes and Cryptography 87 (8), 1777-1796, 2019
312019
An overview of capacity results for synchronization channels
M Cheraghchi, J Ribeiro
IEEE Transactions on Information Theory 67 (6), 3207-3232, 2020
242020
Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
M Cheraghchi, P Indyk
ACM Transactions on Algorithms (TALG) 13 (3), 1-36, 2017
242017
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
212010
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
182020
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20