Elena Grigorescu

154 papers A* 12A 14B 8Misc 1Journal 99Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximation Algorithms for Directed Weighted Spanners. Algorithmica Elena Grigorescu, Nithish Kumar, Young-San Lin
2026	J	`jnl`	Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes. CoRR Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu
2026	A	`conf`	On the Hardness of the One-Sided Code Sparsifier Problem. STACS Elena Grigorescu, Alice Moayyedi
2025	B	`conf`	Communication with Perfect Feedback for Bit Flips and Erasures. ISIT Elena Grigorescu, Shreya Nasa, Maoyuan Song
2025	A	`conf`	Differential Privacy and Sublinear Time Are Incompatible Sometimes. ITCS Jeremiah Blocki, Hendrik Fichtenberger, Elena Grigorescu, Tamalika Mukherjee
2025	A	`conf`	Directed Buy-At-Bulk Spanners. APPROX/RANDOM Elena Grigorescu, Nithish Kumar, Young-San Lin
2025	A	`conf`	Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems. AISTATS Elena Grigorescu, Young-San Lin, Maoyuan Song
2025	J	`jnl`	On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. IEEE Trans. Inf. Theory Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu
2025	—	`conf`	On the Hardness of Approximating Distances of Quantum Codes. FSTTCS Elena Grigorescu, Vatsal Jha, Eric Samperton
2025	J	`jnl`	On the Hardness of the One-Sided Code Sparsifier Problem. CoRR Elena Grigorescu, Alice Moayyedi
2025	J	`jnl`	On the hardness of approximating minimum distances of quantum codes. CoRR Elena Grigorescu, Vatsal Jha, Eric Samperton
2025	J	`jnl`	Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes. CoRR Elena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon
2025	J	`jnl`	Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes. Electron. Colloquium Comput. Complex. Elena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon
2025	J	`jnl`	SIGACT News Complexity Theory Column 126 Locally Decodable Codes for Insertions and Deletions. SIGACT News Elena Grigorescu
2024	J	`jnl`	A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives. CoRR Elena Grigorescu, Young-San Lin, Maoyuan Song
2024	J	`jnl`	Differential privacy and Sublinear time are incompatible sometimes. CoRR Jeremiah Blocki, Hendrik Fichtenberger, Elena Grigorescu, Tamalika Mukherjee
2024	J	`jnl`	Directed Buy-at-Bulk Spanners. CoRR Elena Grigorescu, Nithish Kumar, Young-San Lin
2024	J	`jnl`	Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems. CoRR Elena Grigorescu, Young-San Lin, Maoyuan Song
2024	J	`jnl`	Multicriteria Spanners - A New Tool for Network Design. CoRR Elena Grigorescu, Nithish Kumar, Young-San Lin
2024	B	`conf`	On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. ISIT Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu
2024	J	`jnl`	Special Section on the Sixty-First Annual IEEE Symposium on Foundations of Computer Science (2020). SIAM J. Comput. Yuval Filmus, Elena Grigorescu, Sungjin Im, Yi Li
2023	A	`conf`	Approximation Algorithms for Directed Weighted Spanners. APPROX/RANDOM Elena Grigorescu, Nithish Kumar, Young-San Lin
2023	J	`jnl`	Approximation Algorithms for Directed Weighted Spanners. CoRR Elena Grigorescu, Nithish Kumar, Young-San Lin
2023	A	`conf`	How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. APPROX/RANDOM Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou
2023	A	`conf`	On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CCC Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu
2023	J	`jnl`	On computing discretized Ricci curvatures of graphs: Local algorithms and (localized) fine-grained reductions. Theor. Comput. Sci. Bhaskar DasGupta, Elena Grigorescu, Tamalika Mukherjee
2023	J	`jnl`	On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. CoRR Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu
2022	A*	`conf`	Hardness of Maximum Likelihood Learning of DPPs. COLT Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie
2022	J	`jnl`	Hardness of Maximum Likelihood Learning of DPPs. CoRR Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie
2022	J	`jnl`	Hardness of Maximum Likelihood Learning of DPPs. Electron. Colloquium Comput. Complex. Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie
2022	J	`jnl`	How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. CoRR Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou
2022	A*	`conf`	Learning-Augmented Algorithms for Online Linear and Semidefinite Programming. NeurIPS Elena Grigorescu, Young-San Lin, Sandeep Silwal, Maoyuan Song, Samson Zhou
2022	J	`jnl`	Learning-Augmented Algorithms for Online Linear and Semidefinite Programming. CoRR Elena Grigorescu, Young-San Lin, Sandeep Silwal, Maoyuan Song, Samson Zhou
2022	J	`jnl`	Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance. IEEE Trans. Inf. Theory Elena Grigorescu, Madhu Sudan, Minshen Zhu
2022	J	`jnl`	On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CoRR Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu
2022	J	`jnl`	On computing Ollivier-Ricci curvatures of graphs: fine-grained reductions and local algorithms. CoRR Bhaskar DasGupta, Elena Grigorescu, Tamalika Mukherjee
2022	A*	`conf`	Privately Estimating Graph Parameters in Sublinear Time. ICALP Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee
2022	J	`jnl`	Privately Estimating Graph Parameters in Sublinear time. CoRR Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee
2021	B	`conf`	Differentially-Private Sublinear-Time Clustering. ISIT Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee
2021	J	`jnl`	Differentially-Private Sublinear-Time Clustering. CoRR Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee
2021	A*	`conf`	Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. FOCS Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu
2021	J	`jnl`	Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. CoRR Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu
2021	J	`jnl`	Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. CoRR Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
2021	B	`conf`	Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. ISIT Elena Grigorescu, Madhu Sudan, Minshen Zhu
2021	A	`conf`	List Learning with Attribute Noise. AISTATS Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie
2021	—	`conf`	Online Directed Spanners and Steiner Forests. APPROX-RANDOM Elena Grigorescu, Young-San Lin, Kent Quanrud
2021	J	`jnl`	Online Directed Spanners and Steiner Forests. CoRR Elena Grigorescu, Young-San Lin, Kent Quanrud
2021	J	`jnl`	Relaxed Locally Correctable Codes in Computationally Bounded Channels. IEEE Trans. Inf. Theory Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
2021	J	`jnl`	The Maximum Binary Tree Problem. Algorithmica Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
2020	B	`conf`	Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. IPEC Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
2020	J	`jnl`	Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. CoRR Elena Grigorescu, Madhu Sudan, Minshen Zhu
2020	J	`jnl`	List Learning with Attribute Noise. CoRR Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie
2020	—	`conf`	Locally Decodable/Correctable Codes for Insertions and Deletions. FSTTCS Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu
2020	J	`jnl`	Locally Decodable/Correctable Codes for Insertions and Deletions. CoRR Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu
2020	J	`jnl`	Periodicity in Data Streams with Wildcards. Theory Comput. Syst. Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2020	A	`conf`	The Maximum Binary Tree Problem. ESA Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
2019	J	`jnl`	Flipping Out with Many Flips: Hardness of Testing k-Monotonicity. SIAM J. Discret. Math. Elena Grigorescu, Akash Kumar, Karl Wimmer
2019	J	`jnl`	Nearly Optimal Sparse Group Testing. IEEE Trans. Inf. Theory Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou
2019	B	`conf`	Relaxed Locally Correctable Codes in Computationally Bounded Channels. ISIT Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
2019	J	`jnl`	Structural Results on Matching Estimation with Applications to Streaming. Algorithmica Marc Bury, Elena Grigorescu, Andrew McGregor, Morteza Monemizadeh, Chris Schwiegelshohn, Sofya Vorotnikova, Samson Zhou
2019	J	`jnl`	Testing k-Monotonicity: The Rise and Fall of Boolean Functions. Theory Comput. Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer
2019	J	`jnl`	The Maximum Binary Tree Problem. CoRR Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
2018	J	`jnl`	AC J. Comput. Syst. Sci. Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie
2018	A*	`conf`	Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels. ICALP Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
2018	—	`conf`	Flipping out with Many Flips: Hardness of Testing k-Monotonicity. APPROX-RANDOM Elena Grigorescu, Akash Kumar, Karl Wimmer
2018	A	`conf`	Lattice-based Locality Sensitive Hashing is Optimal. ITCS Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu
2018	J	`jnl`	Local Testing of Lattices. SIAM J. Discret. Math. Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
2018	J	`jnl`	NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. SIAM J. Comput. Venkata Gandikota, Badih Ghazi, Elena Grigorescu
2018	—	`conf`	Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. APPROX-RANDOM Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, Samson Zhou
2018	J	`jnl`	Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. CoRR Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, Samson Zhou
2018	Misc	`conf`	Periodicity in Data Streams with Wildcards. CSR Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2018	J	`jnl`	Periodicity in Data Streams with Wildcards. CoRR Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2018	J	`jnl`	Relaxed Locally Correctable Codes in Computationally Bounded Channels. CoRR Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
2017	—	`conf`	Communication-Efficient Distributed Learning of Discrete Distributions. NIPS Ilias Diakonikolas, Elena Grigorescu, Jerry Li, Abhiram Natarajan, Krzysztof Onak, Ludwig Schmidt
2017	J	`jnl`	Deciding Orthogonality in Construction-A Lattices. SIAM J. Discret. Math. Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
2017	J	`jnl`	K-Monotonicity is Not Testable on the Hypercube. CoRR Elena Grigorescu, Akash Kumar, Karl Wimmer
2017	J	`jnl`	K-Monotonicity is Not Testable on the Hypercube. Electron. Colloquium Comput. Complex. Elena Grigorescu, Akash Kumar, Karl Wimmer
2017	J	`jnl`	Lattice-based Locality Sensitive Hashing is Optimal. CoRR Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu
2017	J	`jnl`	List-Decoding Barnes-Wall Lattices. Comput. Complex. Elena Grigorescu, Chris Peikert
2017	J	`jnl`	Longest Alignment with Edits in Data Streams. CoRR Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2017	—	`conf`	Longest alignment with edits in data streams. Allerton Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2017	—	`conf`	Maximally recoverable codes: The bounded case. Allerton Venkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu
2017	J	`jnl`	Nearly Optimal Sparse Group Testing. CoRR Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou
2017	J	`jnl`	Statistical Algorithms and a Lower Bound for Detecting Planted Cliques. J. ACM Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao
2017	—	`conf`	Streaming Periodicity with Mismatches. APPROX-RANDOM Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2017	J	`jnl`	Streaming Periodicity with Mismatches. CoRR Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2017	—	`conf`	Streaming for Aibohphobes: Longest Palindrome with Mismatches. FSTTCS Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2017	J	`jnl`	Streaming for Aibohphobes: Longest Palindrome with Mismatches. CoRR Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2017	A	`conf`	Testing k-Monotonicity. ITCS Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer
2016	A*	`conf`	AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product. ICALP Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie
2016	J	`jnl`	Estimating Weighted Matchings in o(n) Space. CoRR Elena Grigorescu, Morteza Monemizadeh, Samson Zhou
2016	—	`conf`	Local Testing for Membership in Lattices. FSTTCS Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
2016	J	`jnl`	Local Testing for Membership in Lattices. CoRR Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
2016	J	`jnl`	Local Testing for Membership in Lattices. Electron. Colloquium Comput. Complex. Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
2016	A*	`conf`	NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem. FOCS Venkata Gandikota, Badih Ghazi, Elena Grigorescu
2016	J	`jnl`	NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. CoRR Venkata Gandikota, Badih Ghazi, Elena Grigorescu
2016	J	`jnl`	NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. Electron. Colloquium Comput. Complex. Venkata Gandikota, Badih Ghazi, Elena Grigorescu
2016	—	`conf`	Nearly optimal sparse group testing. Allerton Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou
2016	J	`jnl`	Testing k-Monotonicity. CoRR Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer
2016	J	`jnl`	Testing k-Monotonicity. Electron. Colloquium Comput. Complex. Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer
2015	J	`jnl`	A unified framework for testing linear-invariant properties. Random Struct. Algorithms Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira
2015	J	`jnl`	AC Electron. Colloquium Comput. Complex. Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie
2015	—	`conf`	Deciding Orthogonality in Construction-A Lattices. FSTTCS Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
2015	J	`jnl`	Deciding Orthogonality in Construction-A Lattices. CoRR Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
2015	B	`conf`	On the NP-hardness of bounded distance decoding of Reed-Solomon codes. ISIT Venkata Gandikota, Badih Ghazi, Elena Grigorescu
2014	J	`jnl`	Steiner transitive-closure spanners of low-dimensional posets. Comb. Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev
2013	J	`jnl`	2-Transitivity is Insufficient for Local Testability. Comput. Complex. Elena Grigorescu, Tali Kaufman, Madhu Sudan
2013	J	`jnl`	A lower-variance randomized algorithm for approximate string matching. Inf. Process. Lett. Mikhail J. Atallah, Elena Grigorescu, Yi Wu
2013	J	`jnl`	Error-Correcting Data Structures. SIAM J. Comput. Victor Chen, Elena Grigorescu, Ronald de Wolf
2013	A*	`conf`	Statistical algorithms and a lower bound for detecting planted cliques. STOC Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao
2013	—	`conf`	Tight Lower Bounds for Testing Linear Isomorphism. APPROX-RANDOM Elena Grigorescu, Karl Wimmer, Ning Xie
2013	J	`jnl`	Tight Lower Bounds for Testing Linear Isomorphism. Electron. Colloquium Comput. Complex. Elena Grigorescu, Karl Wimmer, Ning Xie
2012	J	`jnl`	Explicit Low-Weight Bases for BCH Codes. IEEE Trans. Inf. Theory Elena Grigorescu, Tali Kaufman
2012	A	`conf`	List Decoding Barnes-Wall Lattices. CCC Elena Grigorescu, Chris Peikert
2012	J	`jnl`	Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. SIAM J. Discret. Math. Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff
2012	J	`jnl`	Statistical Algorithms and a Lower Bound for Planted Clique. Electron. Colloquium Comput. Complex. Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao
2012	J	`jnl`	Succinct Representation of Codes with Applications to Testing. SIAM J. Discret. Math. Elena Grigorescu, Tali Kaufman, Madhu Sudan
2012	J	`jnl`	Testing Odd-Cycle-Freeness in Boolean Functions. Comb. Probab. Comput. Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira
2012	A*	`conf`	Testing odd-cycle-freeness in Boolean functions. SODA Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira
2012	J	`jnl`	The Complexity of Statistical Algorithms CoRR Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala
2012	J	`jnl`	Transitive-Closure Spanners. SIAM J. Comput. Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff
2011	J	`jnl`	List Decoding Barnes-Wall Lattices CoRR Elena Grigorescu, Chris Peikert
2011	J	`jnl`	List Decoding Barnes-Wall Lattices. Electron. Colloquium Comput. Complex. Elena Grigorescu, Chris Peikert
2011	B	`conf`	On Noise-Tolerant Learning of Sparse Parities and Related Problems. ALT Elena Grigorescu, Lev Reyzin, Santosh S. Vempala
2011	—	`conf`	On Sums of Locally Testable Affine Invariant Properties. APPROX-RANDOM Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan
2011	J	`jnl`	On Sums of Locally Testable Affine Invariant Properties. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan
2011	—	`conf`	Steiner Transitive-Closure Spanners of Low-Dimensional Posets. ICALP (1) Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev
2011	J	`jnl`	Testing Odd-Cycle-Freeness in Boolean Functions CoRR Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira
2011	J	`jnl`	Testing Odd-Cycle-Freeness in Boolean Functions. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira
2010	J	`jnl`	A Unified Framework for Testing Linear-Invariant Properties CoRR Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira
2010	A*	`conf`	A Unified Framework for Testing Linear-Invariant Properties. FOCS Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira
2010	J	`jnl`	A Unified Framework for Testing Linear-Invariant Properties. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira
2010	J	`jnl`	A local decision test for sparse polynomials. Inf. Process. Lett. Elena Grigorescu, Kyomin Jung, Ronitt Rubinfeld
2010	A	`conf`	Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. STACS Victor Chen, Elena Grigorescu, Ronald de Wolf
2010	—	`conf`	Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. APPROX-RANDOM Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff
2010	J	`jnl`	Separations of Matroid Freeness Properties CoRR Arnab Bhattacharyya, Elena Grigorescu, Jakob Nordström, Ning Xie
2010	J	`jnl`	Separations of Matroid Freeness Properties. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Elena Grigorescu, Jakob Nordström, Ning Xie
2010	J	`jnl`	Steiner Transitive-Closure Spanners of d-Dimensional Posets CoRR Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev
2010	—	`—`	Symmetries in algebraic Property Testing. Elena Grigorescu
2009	J	`jnl`	Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation CoRR Victor Chen, Elena Grigorescu, Ronald de Wolf
2009	J	`jnl`	Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. Electron. Colloquium Comput. Complex. Victor Chen, Elena Grigorescu, Ronald de Wolf
2009	J	`jnl`	Succinct Representation of Codes with Applications to Testing CoRR Elena Grigorescu, Tali Kaufman, Madhu Sudan
2009	—	`conf`	Succinct Representation of Codes with Applications to Testing. APPROX-RANDOM Elena Grigorescu, Tali Kaufman, Madhu Sudan
2009	J	`jnl`	Succinct Representation of Codes with Applications to Testing. Electron. Colloquium Comput. Complex. Elena Grigorescu, Tali Kaufman, Madhu Sudan
2009	J	`jnl`	Transitive-Closure Spanners of the Hypercube and the Hypergrid. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff
2009	A*	`conf`	Transitive-closure spanners. SODA Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff
2008	A	`conf`	2-Transitivity Is Insufficient for Local Testability. CCC Elena Grigorescu, Tali Kaufman, Madhu Sudan
2008	J	`jnl`	2-Transitivity is Insufficient for Local Testability. Electron. Colloquium Comput. Complex. Elena Grigorescu, Tali Kaufman, Madhu Sudan
2008	J	`jnl`	Decodability of Group Homomorphisms beyond the Johnson Bound. Electron. Colloquium Comput. Complex. Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan
2008	A*	`conf`	Decodability of group homomorphisms beyond the johnson bound. STOC Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan
2008	J	`jnl`	Transitive-Closure Spanners CoRR Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff
2006	—	`conf`	Local Decoding and Testing for Homomorphisms. APPROX-RANDOM Elena Grigorescu, Swastik Kopparty, Madhu Sudan
2004	J	`jnl`	The insulation sequence of a graph. Discret. Appl. Math. Elena Grigorescu
2003	J	`jnl`	Decreasing the diameter of cycles. J. Graph Theory Elena Grigorescu