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 | 188 | 2017 |

Transitive-closure spanners A Bhattacharyya, E Grigorescu, K Jung, S Raskhodnikova, DP Woodruff SIAM Journal on Computing 41 (6), 1380-1425, 2012 | 113 | 2012 |

A unified framework for testing linear‐invariant properties A Bhattacharyya, E Grigorescu, A Shapira Random Structures & Algorithms 46 (2), 232-260, 2015 | 61 | 2015 |

2-transitivity is insufficient for local testability E Grigorescu, T Kaufman, M Sudan computational complexity 22 (1), 137-158, 2013 | 35 | 2013 |

Communication-efficient distributed learning of discrete distributions I Diakonikolas, E Grigorescu, J Li, A Natarajan, K Onak, L Schmidt NIPS, 2017 | 32 | 2017 |

Succinct representation of codes with applications to testing E Grigorescu, T Kaufman, M Sudan Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009 | 30 | 2009 |

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 | 23 | 2012 |

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 | 23 | 2011 |

Nearly optimal sparse group testing V Gandikota, E Grigorescu, S Jaggi, S Zhou IEEE Transactions on Information Theory 65 (5), 2760-2773, 2019 | 21 | 2019 |

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 | 21 | 2011 |

Efficient and error-correcting data structures for membership and polynomial evaluation V Chen, E Grigorescu, R De Wolf arXiv preprint arXiv:0909.3696, 2009 | 20 | 2009 |

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 |

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 | 17 | 2010 |

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 | 17 | 2008 |

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 | 16 | 2018 |

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 | 13 | 2018 |

Transitive-Closure Spanners of the Hypercube and the Hypergrid. A Bhattacharyya, E Grigorescu, K Jung, S Raskhodnikova, DP Woodruff Electronic Colloquium on Computational Complexity (ECCC) 16, 46, 2009 | 13 | 2009 |

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 | 12 | 2018 |

Testing odd-cycle-freeness in Boolean functions A Bhattacharyya, E Grigorescu, P Raghavendra, A Shapira Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012 | 12 | 2012 |

Explicit low-weight bases for BCH codes E Grigorescu, T Kaufman IEEE transactions on information theory 58 (1), 78-81, 2011 | 12 | 2011 |