| 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 | 251 | 2017 |
| Transitive-closure spanners A Bhattacharyya, E Grigorescu, K Jung, S Raskhodnikova, DP Woodruff SIAM Journal on Computing 41 (6), 1380-1425, 2012 | 119 | 2012 |
| A unified framework for testing linear‐invariant properties A Bhattacharyya, E Grigorescu, A Shapira Random Structures & Algorithms 46 (2), 232-260, 2015 | 65 | 2015 |
| 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 | 44 | 2017 |
| Nearly optimal sparse group testing V Gandikota, E Grigorescu, S Jaggi, S Zhou IEEE Transactions on Information Theory 65 (5), 2760-2773, 2019 | 36 | 2019 |
| 2-transitivity is insufficient for local testability E Grigorescu, T Kaufman, M Sudan computational complexity 22, 137-158, 2013 | 34 | 2013 |
| Succinct representation of codes with applications to testing E Grigorescu, T Kaufman, M Sudan Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009 | 30 | 2009 |
| On noise-tolerant learning of sparse parities and related problems E Grigorescu, L Reyzin, S Vempala Algorithmic Learning Theory: 22nd International Conference, ALT 2011, Espoo …, 2011 | 27 | 2011 |
| 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 | 26 | 2018 |
| 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 | 26 | 2012 |
| On sums of locally testable affine invariant properties E Ben-Sasson, E Grigorescu, G Maatouk, A Shpilka, M Sudan Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011 | 24 | 2011 |
| 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 | 23 | 2018 |
| List decoding barnes-wall lattices E Grigorescu, C Peikert 2012 IEEE 27th Conference on Computational Complexity, 316-325, 2012 | 21* | 2012 |
| 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 | 21 | 2008 |
| Lower bounds for local monotonicity reconstruction from transitive-closure spanners A Bhattacharyya, E Grigorescu, M Jha, K Jung, S Raskhodnikova, ... Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010 | 19 | 2010 |
| Efficient and error-correcting data structures for membership and polynomial evaluation V Chen, E Grigorescu, R De Wolf arXiv preprint arXiv:0909.3696, 2009 | 19 | 2009 |
| Structural results on matching estimation with applications to streaming M Bury, E Grigorescu, A McGregor, M Monemizadeh, C Schwiegelshohn, ... Algorithmica 81, 367-392, 2019 | 18 | 2019 |
| A lower-variance randomized algorithm for approximate string matching MJ Atallah, E Grigorescu, Y Wu Information Processing Letters 113 (18), 690-692, 2013 | 18 | 2013 |
| 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 | 17 | 2021 |
| On the NP-hardness of bounded distance decoding of Reed-Solomon codes V Gandikota, B Ghazi, E Grigorescu 2015 IEEE International Symposium on Information Theory (ISIT), 2904-2908, 2015 | 16 | 2015 |
