default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElena Grigorescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c48]Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu:
On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. ISIT 2024: 879-884- [i60]Elena Grigorescu, Nithish Kumar, Young-San Lin:
Directed Buy-at-Bulk Spanners. CoRR abs/2404.05172 (2024) - [i59]Elena Grigorescu, Young-San Lin, Maoyuan Song:
A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives. CoRR abs/2406.03574 (2024) - [i58]Jeremiah Blocki, Hendrik Fichtenberger, Elena Grigorescu, Tamalika Mukherjee:
Differential privacy and Sublinear time are incompatible sometimes. CoRR abs/2407.07262 (2024) - 2023
- [j28]Bhaskar DasGupta, Elena Grigorescu, Tamalika Mukherjee:
On computing discretized Ricci curvatures of graphs: Local algorithms and (localized) fine-grained reductions. Theor. Comput. Sci. 975: 114127 (2023) - [c47]Elena Grigorescu, Nithish Kumar, Young-San Lin:
Approximation Algorithms for Directed Weighted Spanners. APPROX/RANDOM 2023: 8:1-8:23 - [c46]Jeremiah Blocki
, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou:
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. APPROX/RANDOM 2023: 59:1-59:24 - [c45]Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CCC 2023: 14:1-14:25 - [i57]Elena Grigorescu, Nithish Kumar, Young-San Lin:
Approximation Algorithms for Directed Weighted Spanners. CoRR abs/2307.02774 (2023) - [i56]Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu:
On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. CoRR abs/2308.14993 (2023) - 2022
- [j27]Elena Grigorescu, Madhu Sudan, Minshen Zhu:
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance. IEEE Trans. Inf. Theory 68(10): 6790-6801 (2022) - [c44]Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
Hardness of Maximum Likelihood Learning of DPPs. COLT 2022: 3800-3819 - [c43]Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee:
Privately Estimating Graph Parameters in Sublinear Time. ICALP 2022: 26:1-26:19 - [c42]Elena Grigorescu, Young-San Lin, Sandeep Silwal, Maoyuan Song, Samson Zhou:
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming. NeurIPS 2022 - [i55]Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee:
Privately Estimating Graph Parameters in Sublinear time. CoRR abs/2202.05776 (2022) - [i54]Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
Hardness of Maximum Likelihood Learning of DPPs. CoRR abs/2205.12377 (2022) - [i53]Bhaskar DasGupta, Elena Grigorescu, Tamalika Mukherjee:
On computing Ollivier-Ricci curvatures of graphs: fine-grained reductions and local algorithms. CoRR abs/2208.09535 (2022) - [i52]Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CoRR abs/2209.08688 (2022) - [i51]Elena Grigorescu, Young-San Lin, Sandeep Silwal, Maoyuan Song, Samson Zhou:
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming. CoRR abs/2209.10614 (2022) - [i50]Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou:
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. CoRR abs/2210.03831 (2022) - [i49]Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
Hardness of Maximum Likelihood Learning of DPPs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j26]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. Algorithmica 83(8): 2427-2468 (2021) - [j25]Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou:
Relaxed Locally Correctable Codes in Computationally Bounded Channels. IEEE Trans. Inf. Theory 67(7): 4338-4360 (2021) - [c41]Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
List Learning with Attribute Noise. AISTATS 2021: 2215-2223 - [c40]Elena Grigorescu, Young-San Lin, Kent Quanrud:
Online Directed Spanners and Steiner Forests. APPROX-RANDOM 2021: 5:1-5:25 - [c39]Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. FOCS 2021: 739-750 - [c38]Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee:
Differentially-Private Sublinear-Time Clustering. ISIT 2021: 332-337 - [c37]Elena Grigorescu, Madhu Sudan, Minshen Zhu:
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. ISIT 2021: 2531-2536 - [i48]Elena Grigorescu, Young-San Lin, Kent Quanrud:
Online Directed Spanners and Steiner Forests. CoRR abs/2103.04543 (2021) - [i47]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. CoRR abs/2110.00495 (2021) - [i46]Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. CoRR abs/2111.01060 (2021) - [i45]Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee:
Differentially-Private Sublinear-Time Clustering. CoRR abs/2112.13751 (2021) - 2020
- [j24]Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Periodicity in Data Streams with Wildcards. Theory Comput. Syst. 64(1): 177-197 (2020) - [c36]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. ESA 2020: 30:1-30:22 - [c35]Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu:
Locally Decodable/Correctable Codes for Insertions and Deletions. FSTTCS 2020: 16:1-16:17 - [c34]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. IPEC 2020: 7:1-7:16 - [i44]Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
List Learning with Attribute Noise. CoRR abs/2006.06850 (2020) - [i43]Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu:
Locally Decodable/Correctable Codes for Insertions and Deletions. CoRR abs/2010.11989 (2020) - [i42]Elena Grigorescu, Madhu Sudan, Minshen Zhu:
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. CoRR abs/2011.13737 (2020)
2010 – 2019
- 2019
- [j23]Marc Bury, Elena Grigorescu, Andrew McGregor, Morteza Monemizadeh, Chris Schwiegelshohn, Sofya Vorotnikova, Samson Zhou:
Structural Results on Matching Estimation with Applications to Streaming. Algorithmica 81(1): 367-392 (2019) - [j22]Elena Grigorescu, Akash Kumar, Karl Wimmer:
Flipping Out with Many Flips: Hardness of Testing k-Monotonicity. SIAM J. Discret. Math. 33(4): 2111-2125 (2019) - [j21]Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou:
Nearly Optimal Sparse Group Testing. IEEE Trans. Inf. Theory 65(5): 2760-2773 (2019) - [j20]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity: The Rise and Fall of Boolean Functions. Theory Comput. 15: 1-55 (2019) - [c33]Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou:
Relaxed Locally Correctable Codes in Computationally Bounded Channels. ISIT 2019: 2414-2418 - [i41]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. CoRR abs/1909.07915 (2019) - 2018
- [j19]Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
AC0∘MOD2 lower bounds for the Boolean Inner Product. J. Comput. Syst. Sci. 97: 45-59 (2018) - [j18]Venkata Gandikota, Badih Ghazi, Elena Grigorescu:
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. SIAM J. Comput. 47(4): 1547-1584 (2018) - [j17]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing of Lattices. SIAM J. Discret. Math. 32(2): 1265-1295 (2018) - [c32]Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, Samson Zhou:
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. APPROX-RANDOM 2018: 7:1-7:22 - [c31]Elena Grigorescu, Akash Kumar, Karl Wimmer:
Flipping out with Many Flips: Hardness of Testing k-Monotonicity. APPROX-RANDOM 2018: 40:1-40:17 - [c30]Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Periodicity in Data Streams with Wildcards. CSR 2018: 90-105 - [c29]Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou:
Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels. ICALP 2018: 106:1-106:4 - [c28]Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu:
Lattice-based Locality Sensitive Hashing is Optimal. ITCS 2018: 42:1-42:18 - [i40]Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Periodicity in Data Streams with Wildcards. CoRR abs/1802.07375 (2018) - [i39]Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou:
Relaxed Locally Correctable Codes in Computationally Bounded Channels. CoRR abs/1803.05652 (2018) - [i38]Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, Samson Zhou:
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. CoRR abs/1805.00212 (2018) - 2017
- [j16]Elena Grigorescu, Chris Peikert:
List-Decoding Barnes-Wall Lattices. Comput. Complex. 26(2): 365-392 (2017) - [j15]Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao:
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques. J. ACM 64(2): 8:1-8:37 (2017) - [j14]Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu:
Deciding Orthogonality in Construction-A Lattices. SIAM J. Discret. Math. 31(2): 1244-1262 (2017) - [c27]Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Longest alignment with edits in data streams. Allerton 2017: 405-412 - [c26]Venkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu:
Maximally recoverable codes: The bounded case. Allerton 2017: 1115-1122 - [c25]Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Streaming Periodicity with Mismatches. APPROX-RANDOM 2017: 42:1-42:21 - [c24]Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Streaming for Aibohphobes: Longest Palindrome with Mismatches. FSTTCS 2017: 31:1-31:13 - [c23]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity. ITCS 2017: 29:1-29:21 - [c22]Ilias Diakonikolas, Elena Grigorescu, Jerry Li, Abhiram Natarajan, Krzysztof Onak, Ludwig Schmidt:
Communication-Efficient Distributed Learning of Discrete Distributions. NIPS 2017: 6391-6401 - [i37]Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Streaming for Aibohphobes: Longest Palindrome with Mismatches. CoRR abs/1705.01887 (2017) - [i36]Elena Grigorescu, Akash Kumar, Karl Wimmer:
K-Monotonicity is Not Testable on the Hypercube. CoRR abs/1705.04205 (2017) - [i35]Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou:
Nearly Optimal Sparse Group Testing. CoRR abs/1708.03429 (2017) - [i34]Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Streaming Periodicity with Mismatches. CoRR abs/1708.04381 (2017) - [i33]Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Longest Alignment with Edits in Data Streams. CoRR abs/1711.04367 (2017) - [i32]Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu:
Lattice-based Locality Sensitive Hashing is Optimal. CoRR abs/1712.08558 (2017) - [i31]Elena Grigorescu, Akash Kumar, Karl Wimmer:
K-Monotonicity is Not Testable on the Hypercube. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c21]Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou:
Nearly optimal sparse group testing. Allerton 2016: 401-408 - [c20]Venkata Gandikota, Badih Ghazi, Elena Grigorescu:
NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem. FOCS 2016: 760-769 - [c19]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. FSTTCS 2016: 46:1-46:14 - [c18]Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product. ICALP 2016: 35:1-35:14 - [i30]Elena Grigorescu, Morteza Monemizadeh, Samson Zhou:
Estimating Weighted Matchings in o(n) Space. CoRR abs/1604.07467 (2016) - [i29]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. CoRR abs/1608.00180 (2016) - [i28]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity. CoRR abs/1609.00265 (2016) - [i27]Venkata Gandikota, Badih Ghazi, Elena Grigorescu:
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. CoRR abs/1611.03069 (2016) - [i26]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity. Electron. Colloquium Comput. Complex. TR16 (2016) - [i25]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. Electron. Colloquium Comput. Complex. TR16 (2016) - [i24]Venkata Gandikota, Badih Ghazi, Elena Grigorescu:
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j13]Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira:
A unified framework for testing linear-invariant properties. Random Struct. Algorithms 46(2): 232-260 (2015) - [c17]Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu:
Deciding Orthogonality in Construction-A Lattices. FSTTCS 2015: 151-162 - [c16]Venkata Gandikota, Badih Ghazi, Elena Grigorescu:
On the NP-hardness of bounded distance decoding of Reed-Solomon codes. ISIT 2015: 2904-2908 - [i23]Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu:
Deciding Orthogonality in Construction-A Lattices. CoRR abs/1512.02734 (2015) - [i22]Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
AC0 \circ MOD2 lower bounds for the Boolean Inner Product. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j12]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner transitive-closure spanners of low-dimensional posets. Comb. 34(3): 255-277 (2014) - 2013
- [j11]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
2-Transitivity is Insufficient for Local Testability. Comput. Complex. 22(1): 137-158 (2013) - [j10]Mikhail J. Atallah, Elena Grigorescu, Yi Wu:
A lower-variance randomized algorithm for approximate string matching. Inf. Process. Lett. 113(18): 690-692 (2013) - [j9]Victor Chen, Elena Grigorescu, Ronald de Wolf:
Error-Correcting Data Structures. SIAM J. Comput. 42(1): 84-111 (2013) - [c15]Elena Grigorescu, Karl Wimmer, Ning Xie:
Tight Lower Bounds for Testing Linear Isomorphism. APPROX-RANDOM 2013: 559-574 - [c14]Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao:
Statistical algorithms and a lower bound for detecting planted cliques. STOC 2013: 655-664 - [i21]Elena Grigorescu, Karl Wimmer, Ning Xie:
Tight Lower Bounds for Testing Linear Isomorphism. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j8]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions. Comb. Probab. Comput. 21(6): 835-855 (2012) - [j7]Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff:
Transitive-Closure Spanners. SIAM J. Comput. 41(6): 1380-1425 (2012) - [j6]Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff:
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. SIAM J. Discret. Math. 26(2): 618-646 (2012) - [j5]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
Succinct Representation of Codes with Applications to Testing. SIAM J. Discret. Math. 26(4): 1618-1634 (2012) - [j4]Elena Grigorescu, Tali Kaufman:
Explicit Low-Weight Bases for BCH Codes. IEEE Trans. Inf. Theory 58(1): 78-81 (2012) - [c13]Elena Grigorescu, Chris Peikert:
List Decoding Barnes-Wall Lattices. CCC 2012: 316-325 - [c12]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing odd-cycle-freeness in Boolean functions. SODA 2012: 1140-1149 - [i20]Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala:
The Complexity of Statistical Algorithms. CoRR abs/1201.1214 (2012) - [i19]Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao:
Statistical Algorithms and a Lower Bound for Planted Clique. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c11]Elena Grigorescu, Lev Reyzin, Santosh S. Vempala:
On Noise-Tolerant Learning of Sparse Parities and Related Problems. ALT 2011: 413-424 - [c10]Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
On Sums of Locally Testable Affine Invariant Properties. APPROX-RANDOM 2011: 400-411 - [c9]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner Transitive-Closure Spanners of Low-Dimensional Posets. ICALP (1) 2011: 760-772 - [i18]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions. CoRR abs/1105.1325 (2011) - [i17]Elena Grigorescu, Chris Peikert:
List Decoding Barnes-Wall Lattices. CoRR abs/1112.1994 (2011) - [i16]Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
On Sums of Locally Testable Affine Invariant Properties. Electron. Colloquium Comput. Complex. TR11 (2011) - [i15]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions. Electron. Colloquium Comput. Complex. TR11 (2011) - [i14]Elena Grigorescu, Chris Peikert:
List Decoding Barnes-Wall Lattices. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [b1]Elena Grigorescu:
Symmetries in algebraic Property Testing. Massachusetts Institute of Technology, Cambridge, MA, USA, 2010 - [j3]Elena Grigorescu, Kyomin Jung, Ronitt Rubinfeld:
A local decision test for sparse polynomials. Inf. Process. Lett. 110(20): 898-901 (2010) - [c8]Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff:
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. APPROX-RANDOM 2010: 448-461 - [c7]Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira:
A Unified Framework for Testing Linear-Invariant Properties. FOCS 2010: 478-487 - [c6]Victor Chen, Elena Grigorescu, Ronald de Wolf:
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. STACS 2010: 203-214 - [i13]Arnab Bhattacharyya, Elena Grigorescu, Jakob Nordström, Ning Xie:
Separations of Matroid Freeness Properties. CoRR abs/1008.4401 (2010) - [i12]Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira:
A Unified Framework for Testing Linear-Invariant Properties. CoRR abs/1010.5016 (2010) - [i11]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner Transitive-Closure Spanners of d-Dimensional Posets. CoRR abs/1011.6100 (2010) - [i10]Arnab Bhattacharyya, Elena Grigorescu, Jakob Nordström, Ning Xie:
Separations of Matroid Freeness Properties. Electron. Colloquium Comput. Complex. TR10 (2010) - [i9]Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira:
A Unified Framework for Testing Linear-Invariant Properties. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c5]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
Succinct Representation of Codes with Applications to Testing. APPROX-RANDOM 2009: 534-547 - [c4]Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff:
Transitive-closure spanners. SODA 2009: 932-941 - [i8]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
Succinct Representation of Codes with Applications to Testing. CoRR abs/0905.2919 (2009) - [i7]Victor Chen, Elena Grigorescu, Ronald de Wolf:
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. CoRR abs/0909.3696 (2009) - [i6]Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff:
Transitive-Closure Spanners of the Hypercube and the Hypergrid. Electron. Colloquium Comput. Complex. TR09 (2009) - [i5]Victor Chen, Elena Grigorescu, Ronald de Wolf:
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. Electron. Colloquium Comput. Complex. TR09 (2009) - [i4]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
Succinct Representation of Codes with Applications to Testing. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c3]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
2-Transitivity Is Insufficient for Local Testability. CCC 2008: 259-267 - [c2]Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan:
Decodability of group homomorphisms beyond the johnson bound. STOC 2008: 275-284 - [i3]Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff:
Transitive-Closure Spanners. CoRR abs/0808.1787 (2008) - [i2]Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan:
Decodability of Group Homomorphisms beyond the Johnson Bound. Electron. Colloquium Comput. Complex. TR08 (2008) - [i1]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
2-Transitivity is Insufficient for Local Testability. Electron. Colloquium Comput. Complex. TR08 (2008) - 2006
- [c1]Elena Grigorescu, Swastik Kopparty, Madhu Sudan:
Local Decoding and Testing for Homomorphisms. APPROX-RANDOM 2006: 375-385 - 2004
- [j2]Elena Grigorescu:
The insulation sequence of a graph. Discret. Appl. Math. 134(1-3): 77-90 (2004) - 2003
- [j1]Elena Grigorescu:
Decreasing the diameter of cycles. J. Graph Theory 43(4): 299-303 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 18:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
