Elena Grigorescu
Elena Grigorescu
Verified email at purdue.edu - Homepage
TitleCited byYear
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), 8, 2017
1282017
Transitive-closure spanners
A Bhattacharyya, E Grigorescu, K Jung, S Raskhodnikova, DP Woodruff
SIAM Journal on Computing 41 (6), 1380-1425, 2012
952012
A unified framework for testing linear‐invariant properties
A Bhattacharyya, E Grigorescu, A Shapira
Random Structures & Algorithms 46 (2), 232-260, 2015
482015
2-transitivity is insufficient for local testability
E Grigorescu, T Kaufman, M Sudan
computational complexity 22 (1), 137-158, 2013
312013
Succinct representation of codes with applications to testing
E Grigorescu, T Kaufman, M Sudan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
272009
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, 6391-6401, 2017
172017
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
172011
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
172010
A lower-variance randomized algorithm for approximate string matching
MJ Atallah, E Grigorescu, Y Wu
Information Processing Letters 113 (18), 690-692, 2013
162013
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
162012
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
162011
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
162008
Streaming weighted matchings: Optimal meets greedy
E Grigorescu, M Monemizadeh, S Zhou
arXiv preprint arXiv:1608.01487, 2016
142016
Efficient and error-correcting data structures for membership and polynomial evaluation
V Chen, E Grigorescu, R De Wolf
arXiv preprint arXiv:0909.3696, 2009
142009
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
102018
Testing odd-cycle-freeness in Boolean functions
A Bhattacharyya, E Grigorescu, P Raghavendra, A Shapira
Combinatorics, Probability and Computing 21 (6), 835-855, 2012
102012
Local decoding and testing for homomorphisms
E Grigorescu, S Kopparty, M Sudan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006
102006
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
92015
Error-correcting data structures
V Chen, E Grigorescu, R de Wolf
SIAM Journal on Computing 42 (1), 84-111, 2013
92013
Explicit low-weight bases for BCH codes
E Grigorescu, T Kaufman
IEEE Transactions on Information Theory 58 (1), 78-81, 2011
92011
The system can't perform the operation now. Try again later.
Articles 1–20