Statistical algorithms and a lower bound for detecting planted cliques V Feldman, E Grigorescu, L Reyzin, SS Vempala, Y Xiao
Journal of the ACM (JACM) 64 (2), 1-37, 2017
307 2017 Transitive-closure spanners A Bhattacharyya, E Grigorescu, K Jung, S Raskhodnikova, DP Woodruff
SIAM Journal on Computing 41 (6), 1380-1425, 2012
133 2012 A unified framework for testing linear‐invariant properties A Bhattacharyya, E Grigorescu, A Shapira
Random Structures & Algorithms 46 (2), 232-260, 2015
69 2015 Lower bounds for local monotonicity reconstruction from transitive-closure spanners A Bhattacharyya, E Grigorescu, M Jha, K Jung, S Raskhodnikova, ...
SIAM Journal on Discrete Mathematics 26 (2), 618-646, 2012
51 2012 Communication-efficient distributed learning of discrete distributions I Diakonikolas, E Grigorescu, J Li, A Natarajan, K Onak, L Schmidt
Advances in Neural Information Processing Systems 30, 2017
49 2017 Nearly optimal sparse group testing V Gandikota, E Grigorescu, S Jaggi, S Zhou
IEEE Transactions on Information Theory 65 (5), 2760-2773, 2019
47 2019 2-transitivity is insufficient for local testability E Grigorescu, T Kaufman, M Sudan
computational complexity 22, 137-158, 2013
36 2013 Error-correcting data structures V Chen, E Grigorescu, R de Wolf
SIAM Journal on Computing 42 (1), 84-111, 2013
36 * 2013 Nearly optimal distinct elements and heavy hitters on sliding windows V Braverman, E Grigorescu, H Lang, DP Woodruff, S Zhou
arXiv preprint arXiv:1805.00212, 2018
32 2018 On noise-tolerant learning of sparse parities and related problems E Grigorescu, L Reyzin, S Vempala
International Conference on Algorithmic Learning Theory, 413-424, 2011
32 2011 Succinct representation of codes with applications to testing E Grigorescu, T Kaufman, M Sudan
International Workshop on Approximation Algorithms for Combinatorial …, 2009
30 2009 NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem V Gandikota, B Ghazi, E Grigorescu
SIAM Journal on Computing 47 (4), 1547-1584, 2018
27 * 2018 Testing CL Canonne, E Grigorescu, S Guo, A Kumar, K Wimmer
arXiv preprint arXiv:1609.00265, 2016
27 * 2016 Relaxed locally correctable codes in computationally bounded channels J Blocki, V Gandikota, E Grigorescu, S Zhou
IEEE Transactions on Information Theory 67 (7), 4338-4360, 2021
25 2021 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
25 2018 Decodability of group homomorphisms beyond the Johnson bound I Dinur, E Grigorescu, S Kopparty, M Sudan
Proceedings of the fortieth annual ACM symposium on Theory of computing, 275-284, 2008
25 2008 On sums of locally testable affine invariant properties E Ben-Sasson, E Grigorescu, G Maatouk, A Shpilka, M Sudan
International Workshop on Approximation Algorithms for Combinatorial …, 2011
24 2011 List decoding barnes-wall lattices E Grigorescu, C Peikert
2012 IEEE 27th Conference on Computational Complexity, 316-325, 2012
23 * 2012 Limitations of mean-based algorithms for trace reconstruction at small edit distance E Grigorescu, M Sudan, M Zhu
IEEE Transactions on Information Theory 68 (10), 6790-6801, 2022
22 * 2022 Structural results on matching estimation with applications to streaming M Bury, E Grigorescu, A McGregor, M Monemizadeh, C Schwiegelshohn, ...
Algorithmica 81, 367-392, 2019
21 2019 