Decreasing the diameter of cycles. - Elena Grigorescu (J. Graph Theory, 2003)

The insulation sequence of a graph. - Elena Grigorescu (Discret. Appl. Math., 2004)

Local Decoding and Testing for Homomorphisms. - Elena Grigorescu; Swastik Kopparty; Madhu Sudan 001 (APPROX-RANDOM, 2006)

Decodability of Group Homomorphisms beyond the Johnson Bound. - Irit Dinur; Elena Grigorescu; Swastik Kopparty; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2008)

Transitive-Closure Spanners of the Hypercube and the Hypergrid. - Arnab Bhattacharyya 001; Elena Grigorescu; Kyomin Jung; Sofya Raskhodnikova; David P. Woodruff (Electron. Colloquium Comput. Complex., 2009)

Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. - Victor Chen; Elena Grigorescu; Ronald de Wolf (Electron. Colloquium Comput. Complex., 2009)

Succinct Representation of Codes with Applications to Testing. - Elena Grigorescu; Tali Kaufman; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2009)

Steiner Transitive-Closure Spanners of d-Dimensional Posets - Piotr Berman; Arnab Bhattacharyya 001; Elena Grigorescu; Sofya Raskhodnikova; David P. Woodruff; Grigory Yaroslavtsev (CoRR, 2010)

Separations of Matroid Freeness Properties. - Arnab Bhattacharyya 001; Elena Grigorescu; Jakob Nordström; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2010)

A Unified Framework for Testing Linear-Invariant Properties. - Arnab Bhattacharyya 001; Elena Grigorescu; Asaf Shapira (Electron. Colloquium Comput. Complex., 2010)

A local decision test for sparse polynomials. - Elena Grigorescu; Kyomin Jung; Ronitt Rubinfeld (Inf. Process. Lett., 2010)

Symmetries in algebraic Property Testing. - Elena Grigorescu (2010)

On Noise-Tolerant Learning of Sparse Parities and Related Problems. - Elena Grigorescu; Lev Reyzin; Santosh S. Vempala (ALT, 2011)

On Sums of Locally Testable Affine Invariant Properties. - Eli Ben-Sasson; Elena Grigorescu; Ghid Maatouk; Amir Shpilka; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2011)

Testing Odd-Cycle-Freeness in Boolean Functions. - Arnab Bhattacharyya 001; Elena Grigorescu; Prasad Raghavendra; Asaf Shapira (Electron. Colloquium Comput. Complex., 2011)

The Complexity of Statistical Algorithms - Vitaly Feldman; Elena Grigorescu; Lev Reyzin; Santosh S. Vempala (CoRR, 2012)

Statistical Algorithms and a Lower Bound for Planted Clique. - Vitaly Feldman; Elena Grigorescu; Lev Reyzin; Santosh S. Vempala; Ying Xiao 003 (Electron. Colloquium Comput. Complex., 2012)

Transitive-Closure Spanners. - Arnab Bhattacharyya 001; Elena Grigorescu; Kyomin Jung; Sofya Raskhodnikova; David P. Woodruff (SIAM J. Comput., 2012)

Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. - Arnab Bhattacharyya 001; Elena Grigorescu; Madhav Jha; Kyomin Jung; Sofya Raskhodnikova; David P. Woodruff (SIAM J. Discret. Math., 2012)

Explicit Low-Weight Bases for BCH Codes. - Elena Grigorescu; Tali Kaufman (IEEE Trans. Inf. Theory, 2012)

2-Transitivity is Insufficient for Local Testability. - Elena Grigorescu; Tali Kaufman; Madhu Sudan 001 (Comput. Complex., 2013)

Tight Lower Bounds for Testing Linear Isomorphism. - Elena Grigorescu; Karl Wimmer; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2013)

A lower-variance randomized algorithm for approximate string matching. - Mikhail J. Atallah; Elena Grigorescu; Yi Wu 002 (Inf. Process. Lett., 2013)

Error-Correcting Data Structures. - Victor Chen; Elena Grigorescu; Ronald de Wolf (SIAM J. Comput., 2013)

Steiner transitive-closure spanners of low-dimensional posets. - Piotr Berman; Arnab Bhattacharyya 001; Elena Grigorescu; Sofya Raskhodnikova; David P. Woodruff; Grigory Yaroslavtsev (Comb., 2014)

On the NP-hardness of bounded distance decoding of Reed-Solomon codes. - Venkata Gandikota; Badih Ghazi; Elena Grigorescu (ISIT, 2015)

AC0 circ MOD2 lower bounds for the Boolean Inner Product. - Mahdi Cheraghchi; Elena Grigorescu; Brendan Juba; Karl Wimmer; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2015)

AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product. - Mahdi Cheraghchi; Elena Grigorescu; Brendan Juba; Karl Wimmer; Ning Xie 002 (ICALP, 2016)

Estimating Weighted Matchings in o(n) Space. - Elena Grigorescu; Morteza Monemizadeh; Samson Zhou (CoRR, 2016)

Testing k-Monotonicity. - Clément L. Canonne; Elena Grigorescu; Siyao Guo; Akash Kumar 003; Karl Wimmer (Electron. Colloquium Comput. Complex., 2016)

Local Testing for Membership in Lattices. - Karthekeyan Chandrasekaran; Mahdi Cheraghchi; Venkata Gandikota; Elena Grigorescu (Electron. Colloquium Comput. Complex., 2016)

Maximally recoverable codes: The bounded case. - Venkata Gandikota; Elena Grigorescu; Clayton Thomas; Minshen Zhu (Allerton, 2017)

Longest alignment with edits in data streams. - Elena Grigorescu; Erfan Sadeqi Azer; Samson Zhou (Allerton, 2017)

Streaming Periodicity with Mismatches. - Funda Ergün; Elena Grigorescu; Erfan Sadeqi Azer; Samson Zhou (APPROX-RANDOM, 2017)

Streaming for Aibohphobes: Longest Palindrome with Mismatches. - Elena Grigorescu; Erfan Sadeqi Azer; Samson Zhou (FSTTCS, 2017)

Communication-Efficient Distributed Learning of Discrete Distributions. - Ilias Diakonikolas; Elena Grigorescu; Jerry Li 001; Abhiram Natarajan; Krzysztof Onak; Ludwig Schmidt (NIPS, 2017)

List-Decoding Barnes-Wall Lattices. - Elena Grigorescu; Chris Peikert (Comput. Complex., 2017)

K-Monotonicity is Not Testable on the Hypercube. - Elena Grigorescu; Akash Kumar 003; Karl Wimmer (Electron. Colloquium Comput. Complex., 2017)

Statistical Algorithms and a Lower Bound for Detecting Planted Cliques. - Vitaly Feldman; Elena Grigorescu; Lev Reyzin; Santosh S. Vempala; Ying Xiao 003 (J. ACM, 2017)

Deciding Orthogonality in Construction-A Lattices. - Karthekeyan Chandrasekaran; Venkata Gandikota; Elena Grigorescu (SIAM J. Discret. Math., 2017)

Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. - Vladimir Braverman; Elena Grigorescu; Harry Lang; David P. Woodruff; Samson Zhou (APPROX-RANDOM, 2018)

Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels. - Jeremiah Blocki; Venkata Gandikota; Elena Grigorescu; Samson Zhou (ICALP, 2018)

Lattice-based Locality Sensitive Hashing is Optimal. - Karthekeyan Chandrasekaran; Daniel Dadush; Venkata Gandikota; Elena Grigorescu (ITCS, 2018)

AC0∘MOD2 lower bounds for the Boolean Inner Product. - Mahdi Cheraghchi; Elena Grigorescu; Brendan Juba; Karl Wimmer; Ning Xie 002 (J. Comput. Syst. Sci., 2018)

NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. - Venkata Gandikota; Badih Ghazi; Elena Grigorescu (SIAM J. Comput., 2018)

Local Testing of Lattices. - Karthekeyan Chandrasekaran; Mahdi Cheraghchi; Venkata Gandikota; Elena Grigorescu (SIAM J. Discret. Math., 2018)

Structural Results on Matching Estimation with Applications to Streaming. - Marc Bury; Elena Grigorescu; Andrew McGregor 001; Morteza Monemizadeh; Chris Schwiegelshohn; Sofya Vorotnikova; Samson Zhou (Algorithmica, 2019)

Flipping Out with Many Flips: Hardness of Testing k-Monotonicity. - Elena Grigorescu; Akash Kumar 003; Karl Wimmer (SIAM J. Discret. Math., 2019)

Nearly Optimal Sparse Group Testing. - Venkata Gandikota; Elena Grigorescu; Sidharth Jaggi; Samson Zhou (IEEE Trans. Inf. Theory, 2019)

Testing k-Monotonicity: The Rise and Fall of Boolean Functions. - Clément L. Canonne; Elena Grigorescu; Siyao Guo; Akash Kumar 003; Karl Wimmer (Theory Comput., 2019)

Locally Decodable/Correctable Codes for Insertions and Deletions. - Alexander R. Block; Jeremiah Blocki; Elena Grigorescu; Shubhang Kulkarni; Minshen Zhu (FSTTCS, 2020)

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. - Karthekeyan Chandrasekaran; Elena Grigorescu; Gabriel Istrate; Shubhang Kulkarni; Young-San Lin; Minshen Zhu (IPEC, 2020)

Periodicity in Data Streams with Wildcards. - Funda Ergün; Elena Grigorescu; Erfan Sadeqi Azer; Samson Zhou (Theory Comput. Syst., 2020)

List Learning with Attribute Noise. - Mahdi Cheraghchi; Elena Grigorescu; Brendan Juba; Karl Wimmer; Ning Xie 002 (AISTATS, 2021)

Online Directed Spanners and Steiner Forests. - Elena Grigorescu; Young-San Lin; Kent Quanrud (APPROX-RANDOM, 2021)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. - Jeremiah Blocki; Kuan Cheng; Elena Grigorescu; Xin Li 006; Yu Zheng 014; Minshen Zhu (FOCS, 2021)

Differentially-Private Sublinear-Time Clustering. - Jeremiah Blocki; Elena Grigorescu; Tamalika Mukherjee (ISIT, 2021)

Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. - Elena Grigorescu; Madhu Sudan 001; Minshen Zhu (ISIT, 2021)

The Maximum Binary Tree Problem. - Karthekeyan Chandrasekaran; Elena Grigorescu; Gabriel Istrate; Shubhang Kulkarni; Young-San Lin; Minshen Zhu (Algorithmica, 2021)

Relaxed Locally Correctable Codes in Computationally Bounded Channels. - Jeremiah Blocki; Venkata Gandikota; Elena Grigorescu; Samson Zhou (IEEE Trans. Inf. Theory, 2021)

Privately Estimating Graph Parameters in Sublinear Time. - Jeremiah Blocki; Elena Grigorescu; Tamalika Mukherjee (ICALP, 2022)

Learning-Augmented Algorithms for Online Linear and Semidefinite Programming. - Elena Grigorescu; Young-San Lin; Sandeep Silwal; Maoyuan Song; Samson Zhou (NeurIPS, 2022)

On computing Ollivier-Ricci curvatures of graphs: fine-grained reductions and local algorithms. - Bhaskar DasGupta; Elena Grigorescu; Tamalika Mukherjee (CoRR, 2022)

Hardness of Maximum Likelihood Learning of DPPs. - Elena Grigorescu; Brendan Juba; Karl Wimmer; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2022)

Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance. - Elena Grigorescu; Madhu Sudan 001; Minshen Zhu (IEEE Trans. Inf. Theory, 2022)

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 (APPROX/RANDOM, 2023)

Approximation Algorithms for Directed Weighted Spanners. - Elena Grigorescu; Nithish Kumar; Young-San Lin (APPROX/RANDOM, 2023)

On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. - Alexander R. Block; Jeremiah Blocki; Kuan Cheng; Elena Grigorescu; Xin Li 006; Yu Zheng 014; Minshen Zhu (CCC, 2023)

On computing discretized Ricci curvatures of graphs: Local algorithms and (localized) fine-grained reductions. - Bhaskar DasGupta; Elena Grigorescu; Tamalika Mukherjee (Theor. Comput. Sci., 2023)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives. - Elena Grigorescu; Young-San Lin; Maoyuan Song (CoRR, 2024)

Multicriteria Spanners - A New Tool for Network Design. - Elena Grigorescu; Nithish Kumar; Young-San Lin (CoRR, 2024)

Special Section on the Sixty-First Annual IEEE Symposium on Foundations of Computer Science (2020). - Yuval Filmus; Elena Grigorescu; Sungjin Im; Yi Li (SIAM J. Comput., 2024)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems. - Elena Grigorescu; Young-San Lin; Maoyuan Song (AISTATS, 2025)

Directed Buy-At-Bulk Spanners. - Elena Grigorescu; Nithish Kumar; Young-San Lin (APPROX/RANDOM, 2025)

Differential Privacy and Sublinear Time Are Incompatible Sometimes. - Jeremiah Blocki; Hendrik Fichtenberger; Elena Grigorescu; Tamalika Mukherjee (ITCS, 2025)

On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. - Kuan Cheng; Elena Grigorescu; Xin Li 006; Madhu Sudan 001; Minshen Zhu (IEEE Trans. Inf. Theory, 2025)