| 2026 | STOC | Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes. | Elena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon |
| 2026 | STACS | On the Hardness of the One-Sided Code Sparsifier Problem. | Elena Grigorescu, Alice Moayyedi |
| 2025 | AISTATS | Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems. | Elena Grigorescu, Young-San Lin, Maoyuan Song |
| 2025 | ISIT | Communication with Perfect Feedback for Bit Flips and Erasures. | Elena Grigorescu, Shreya Nasa, Maoyuan Song |
| 2024 | ISIT | On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. | Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu |
| 2022 | COLT | Hardness of Maximum Likelihood Learning of DPPs. | Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie |
| 2022 | ICALP | Privately Estimating Graph Parameters in Sublinear Time. | Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee |
| 2021 | AISTATS | List Learning with Attribute Noise. | Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie |
| 2021 | FOCS | Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. | Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu |
| 2021 | ISIT | Differentially-Private Sublinear-Time Clustering. | Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee |
| 2021 | ISIT | Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. | Elena Grigorescu, Madhu Sudan, Minshen Zhu |
| 2020 | ESA | The Maximum Binary Tree Problem. | Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu |
| 2019 | ISIT | Relaxed Locally Correctable Codes in Computationally Bounded Channels. | Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou |
| 2018 | CSR | Periodicity in Data Streams with Wildcards. | Funda Ergn, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou |
| 2018 | ICALP | Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels. | Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou |
| 2016 | FOCS | NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem. | Venkata Gandikota, Badih Ghazi, Elena Grigorescu |
| 2016 | ICALP | AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product. | Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie |
| 2015 | ISIT | On the NP-hardness of bounded distance decoding of Reed-Solomon codes. | Venkata Gandikota, Badih Ghazi, Elena Grigorescu |
| 2013 | STOC | Statistical algorithms and a lower bound for detecting planted cliques. | Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao |
| 2012 | SODA | Testing odd-cycle-freeness in Boolean functions. | Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira |
| 2011 | ALT | On Noise-Tolerant Learning of Sparse Parities and Related Problems. | Elena Grigorescu, Lev Reyzin, Santosh S. Vempala |
| 2011 | ICALP | Steiner Transitive-Closure Spanners of Low-Dimensional Posets. | Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev |
| 2010 | FOCS | A Unified Framework for Testing Linear-Invariant Properties. | Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira |
| 2010 | STACS | Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. | Victor Chen, Elena Grigorescu, Ronald de Wolf |
| 2009 | SODA | Transitive-closure spanners. | Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff |
| 2008 | STOC | Decodability of group homomorphisms beyond the johnson bound. | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan |