Elena Grigorescu

Most-cited papers

Statistical algorithms and a lower bound for detecting planted cliques
V. Feldman, Elena Grigorescu, L. Reyzin, S. Vempala +1 more
2012Symposium on the Theory of Computing249 citations
Semantic Scholar
A Unified Framework for Testing Linear-Invariant Properties
Arnab Bhattacharyya, Elena Grigorescu, A. Shapira
2010IEEE Annual Symposium on Foundations of Computer Science60 citations Open access
Semantic Scholar
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung +2 more
2010International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques47 citations
Semantic Scholar
Nearly optimal sparse group testing
V. Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou
2016Allerton Conference on Communication, Control, and Computing37 citations
Semantic Scholar
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows
V. Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff +1 more
2018International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques36 citations
Semantic Scholar
Communication-Efficient Distributed Learning of Discrete Distributions
Ilias Diakonikolas, Elena Grigorescu, Jerry Li, Abhiram Natarajan +2 more
2017Neural Information Processing Systems35 citations
Semantic Scholar
Statistical Algorithms and a Lower Bound for Planted Clique
V. Feldman, Elena Grigorescu, L. Reyzin, S. Vempala +1 more
2012Electron. Colloquium Comput. Complex.35 citations
Semantic Scholar
Succinct Representation of Codes with Applications to Testing
Elena Grigorescu, T. Kaufman, M. Sudan
2009SIAM Journal on Discrete Mathematics33 citations Open access
Semantic Scholar
2-Transitivity is Insufficient for Local Testability
Elena Grigorescu, T. Kaufman, M. Sudan
2008Computational Complexity30 citations
Semantic Scholar
On Noise-Tolerant Learning of Sparse Parities and Related Problems
Elena Grigorescu, L. Reyzin, S. Vempala
2011International Conference on Algorithmic Learning Theory24 citations Open access
Semantic Scholar
Decodability of group homomorphisms beyond the johnson bound
Irit Dinur, Elena Grigorescu, Swastik Kopparty, M. Sudan
2008Electron. Colloquium Comput. Complex.24 citations
Semantic Scholar
Relaxed Locally Correctable Codes in Computationally Bounded Channels
Jeremiah Blocki, V. Gandikota, Elena Grigorescu, Samson Zhou
2018IEEE Transactions on Information Theory21 citations Open access
Semantic Scholar
List-Decoding Barnes–Wall Lattices
Elena Grigorescu, Chris Peikert
2011Computational Complexity21 citations Open access
Semantic Scholar
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming
Elena Grigorescu, Young-San Lin, Sandeep Silwal, Maoyuan Song +1 more
2022Neural Information Processing Systems20 citations Open access
Semantic Scholar
On Sums of Locally Testable Affine Invariant Properties
E. Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka +1 more
2011International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques20 citations Open access
Semantic Scholar
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity
Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou
2022International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques19 citations Open access
Semantic Scholar
Structural Results on Matching Estimation with Applications to Streaming
Marc Bury, Elena Grigorescu, A. Mcgregor, M. Monemizadeh +3 more
2018Algorithmica19 citations
Semantic Scholar
AC0∘MOD2 lower bounds for the Boolean Inner Product
Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, K. Wimmer +1 more
2018Journal of computer and system sciences (Print)18 citations Open access
Semantic Scholar
NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem
V. Gandikota, Badih Ghazi, Elena Grigorescu
2016IEEE Annual Symposium on Foundations of Computer Science18 citations Open access
Semantic Scholar
AC 0 ◦ MOD 2 lower bounds for the Boolean Inner Product
Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, K. Wimmer +1 more
201518 citations
Semantic Scholar
Local Decoding and Testing for Homomorphisms
Elena Grigorescu, Swastik Kopparty, M. Sudan
2006International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques16 citations Open access
Semantic Scholar
Privately Estimating Graph Parameters in Sublinear time
Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee
2022International Colloquium on Automata, Languages and Programming15 citations
Semantic Scholar
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors
Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu +3 more
2022Cybersecurity and Cyberforensics Conference14 citations Open access
Semantic Scholar
On the NP-hardness of bounded distance decoding of Reed-Solomon codes
V. Gandikota, Badih Ghazi, Elena Grigorescu
2015International Symposium on Information Theory14 citations
Semantic Scholar
Streaming Periodicity with Mismatches
Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2017International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques13 citations
Semantic Scholar
Streaming Weighted Matchings: Optimal Meets Greedy
Elena Grigorescu, M. Monemizadeh, Samson Zhou
2016arXiv.org13 citations
Semantic Scholar
Steiner transitive-closure spanners of low-dimensional posets
P. Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova +2 more
2010Comb.13 citations Open access
Semantic Scholar
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance
Elena Grigorescu, Madhu Sudant, Min-Shen Zhu
2020International Symposium on Information Theory12 citations
Semantic Scholar
A lower-variance randomized algorithm for approximate string matching
M. Atallah, Elena Grigorescu, Yi Wu
2013Information Processing Letters12 citations
Semantic Scholar
A local decision test for sparse polynomials
Elena Grigorescu, Kyomin Jung, R. Rubinfeld
2010Information Processing Letters12 citations Open access
Semantic Scholar
On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction
Kuan Cheng, Elena Grigorescu, Xin-Li-Xin Li, M. Sudan +1 more
2023International Symposium on Information Theory11 citations
Semantic Scholar
Locally Decodable/Correctable Codes for Insertions and Deletions
Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni +1 more
2020Foundations of Software Technology and Theoretical Computer Science11 citations Open access
Semantic Scholar
Explicit Low-Weight Bases for BCH Codes
Elena Grigorescu, T. Kaufman
2012IEEE Transactions on Information Theory11 citations
Semantic Scholar
Transitive-Closure Spanners of the Hypercube and the Hypergrid
Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova +1 more
2009Electron. Colloquium Comput. Complex.11 citations
Semantic Scholar
Testing k-Monotonicity
C. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar +1 more
2016Information Technology Convergence and Services10 citations
Semantic Scholar
Testing Odd-Cycle-Freeness in Boolean Functions
Arnab Bhattacharyya, Elena Grigorescu, P. Raghavendra, A. Shapira
2011Combinatorics, probability & computing10 citations Open access
Semantic Scholar
Hardness of Maximum Likelihood Learning of DPPs
Elena Grigorescu, Brendan Juba, K. Wimmer, Ning Xie
2022Annual Conference Computational Learning Theory9 citations Open access
Semantic Scholar
Online Directed Spanners and Steiner Forests
Elena Grigorescu, Young-San Lin, Kent Quanrud
2021International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques9 citations
Semantic Scholar
Tight Lower Bounds for Testing Linear Isomorphism
Elena Grigorescu, K. Wimmer, Ning Xie
2013International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques9 citations Open access
Semantic Scholar
Approximation Algorithms for Directed Weighted Spanners
Elena Grigorescu, Nithish Kumar, Young-San Lin
2023Algorithmica8 citations Open access
Semantic Scholar
Differentially-Private Sublinear-Time Clustering
Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee
2021International Symposium on Information Theory8 citations Open access
Semantic Scholar
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li +2 more
2021IEEE Annual Symposium on Foundations of Computer Science8 citations Open access
Semantic Scholar
Periodicity in Data Streams with Wildcards
Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2018Theory of Computing Systems8 citations
Semantic Scholar
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance
Elena Grigorescu, M. Sudan, Min-Shen Zhu
2022IEEE Transactions on Information Theory7 citations
Semantic Scholar
Deciding Orthogonality in Construction-A Lattices
K. Chandrasekaran, V. Gandikota, Elena Grigorescu
2015SIAM Journal on Discrete Mathematics7 citations Open access
Semantic Scholar
The insulation sequence of a graph
Elena Grigorescu
2004Discrete Applied Mathematics6 citations Open access
Semantic Scholar
The Impact of ICT Investments on GDP in Central and South-East Europe
Dimitrie-Daniel Plăcintă, Elena Grigorescu, Bogdan-Stefan Posedaru, Florin-Valeriu Pantelimon +2 more
2022Informatică economică5 citations Open access
Semantic Scholar
Nearly Optimal Sparse Group Testing
V. Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou
2019IEEE Transactions on Information Theory5 citations Open access
Semantic Scholar
Lattice-based Locality Sensitive Hashing is Optimal
K. Chandrasekaran, D. Dadush, V. Gandikota, Elena Grigorescu
2017Information Technology Convergence and Services5 citations
Semantic Scholar
Symmetries in algebraic Property Testing
Elena Grigorescu
20105 citations
Semantic Scholar