 | 2012 |
| 35 |  | Arnab Bhattacharyya,
Elena Grigorescu,
Prasad Raghavendra,
Asaf Shapira:
Testing odd-cycle-freeness in Boolean functions.
SODA 2012: 1140-1149 |
| 34 |  | Vitaly Feldman,
Elena Grigorescu,
Lev Reyzin,
Santosh Vempala:
The Complexity of Statistical Algorithms
CoRR abs/1201.1214: (2012) |
| 33 |  | Vitaly Feldman,
Elena Grigorescu,
Lev Reyzin,
Santosh Vempala,
Ying Xiao:
Statistical Algorithms and a Lower Bound for Planted Clique.
Electronic Colloquium on Computational Complexity (ECCC) 19: 64 (2012) |
| 32 |  | Elena Grigorescu,
Tali Kaufman:
Explicit Low-Weight Bases for BCH Codes.
IEEE Transactions on Information Theory 58(1): 78-81 (2012) |
| 2011 |
| 31 |  | Elena Grigorescu,
Lev Reyzin,
Santosh Vempala:
On Noise-Tolerant Learning of Sparse Parities and Related Problems.
ALT 2011: 413-424 |
| 30 |  | Eli Ben-Sasson,
Elena Grigorescu,
Ghid Maatouk,
Amir Shpilka,
Madhu Sudan:
On Sums of Locally Testable Affine Invariant Properties.
APPROX-RANDOM 2011: 400-411 |
| 29 |  | 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 |
| 28 |  | Arnab Bhattacharyya,
Elena Grigorescu,
Prasad Raghavendra,
Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions
CoRR abs/1105.1325: (2011) |
| 27 |  | Elena Grigorescu,
Chris Peikert:
List Decoding Barnes-Wall Lattices
CoRR abs/1112.1994: (2011) |
| 26 |  | Elena Grigorescu,
Chris Peikert:
List Decoding Barnes-Wall Lattices.
Electronic Colloquium on Computational Complexity (ECCC) 18: 165 (2011) |
| 25 |  | Arnab Bhattacharyya,
Elena Grigorescu,
Prasad Raghavendra,
Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions.
Electronic Colloquium on Computational Complexity (ECCC) 18: 75 (2011) |
| 24 |  | Eli Ben-Sasson,
Elena Grigorescu,
Ghid Maatouk,
Amir Shpilka,
Madhu Sudan:
On Sums of Locally Testable Affine Invariant Properties.
Electronic Colloquium on Computational Complexity (ECCC) 18: 79 (2011) |
| 2010 |
| 23 |  | 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 |
| 22 |  | Arnab Bhattacharyya,
Elena Grigorescu,
Asaf Shapira:
A Unified Framework for Testing Linear-Invariant Properties.
FOCS 2010: 478-487 |
| 21 |  | Victor Chen,
Elena Grigorescu,
Ronald de Wolf:
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation.
STACS 2010: 203-214 |
| 20 |  | Arnab Bhattacharyya,
Elena Grigorescu,
Jakob Nordström,
Ning Xie:
Separations of Matroid Freeness Properties
CoRR abs/1008.4401: (2010) |
| 19 |  | Arnab Bhattacharyya,
Elena Grigorescu,
Asaf Shapira:
A Unified Framework for Testing Linear-Invariant Properties
CoRR abs/1010.5016: (2010) |
| 18 |  | 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) |
| 17 |  | Arnab Bhattacharyya,
Elena Grigorescu,
Jakob Nordström,
Ning Xie:
Separations of Matroid Freeness Properties.
Electronic Colloquium on Computational Complexity (ECCC) 17: 136 (2010) |
| 16 |  | Arnab Bhattacharyya,
Elena Grigorescu,
Asaf Shapira:
A Unified Framework for Testing Linear-Invariant Properties.
Electronic Colloquium on Computational Complexity (ECCC) 17: 161 (2010) |
| 15 |  | Elena Grigorescu,
Kyomin Jung,
Ronitt Rubinfeld:
A local decision test for sparse polynomials.
Inf. Process. Lett. 110(20): 898-901 (2010) |
| 2009 |
| 14 |  | Elena Grigorescu,
Tali Kaufman,
Madhu Sudan:
Succinct Representation of Codes with Applications to Testing.
APPROX-RANDOM 2009: 534-547 |
| 13 |  | Arnab Bhattacharyya,
Elena Grigorescu,
Kyomin Jung,
Sofya Raskhodnikova,
David P. Woodruff:
Transitive-closure spanners.
SODA 2009: 932-941 |
| 12 |  | Elena Grigorescu,
Tali Kaufman,
Madhu Sudan:
Succinct Representation of Codes with Applications to Testing
CoRR abs/0905.2919: (2009) |
| 11 |  | Victor Chen,
Elena Grigorescu,
Ronald de Wolf:
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
CoRR abs/0909.3696: (2009) |
| 10 |  | Elena Grigorescu,
Tali Kaufman,
Madhu Sudan:
Succinct Representation of Codes with Applications to Testing.
Electronic Colloquium on Computational Complexity (ECCC) 16: 43 (2009) |
| 9 |  | Arnab Bhattacharyya,
Elena Grigorescu,
Kyomin Jung,
Sofya Raskhodnikova,
David P. Woodruff:
Transitive-Closure Spanners of the Hypercube and the Hypergrid.
Electronic Colloquium on Computational Complexity (ECCC) 16: 46 (2009) |
| 8 |  | Victor Chen,
Elena Grigorescu,
Ronald de Wolf:
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation.
Electronic Colloquium on Computational Complexity (ECCC) 16: 79 (2009) |
| 2008 |
| 7 |  | Elena Grigorescu,
Tali Kaufman,
Madhu Sudan:
2-Transitivity Is Insufficient for Local Testability.
IEEE Conference on Computational Complexity 2008: 259-267 |
| 6 |  | Irit Dinur,
Elena Grigorescu,
Swastik Kopparty,
Madhu Sudan:
Decodability of group homomorphisms beyond the johnson bound.
STOC 2008: 275-284 |
| 5 |  | Arnab Bhattacharyya,
Elena Grigorescu,
Kyomin Jung,
Sofya Raskhodnikova,
David P. Woodruff:
Transitive-Closure Spanners
CoRR abs/0808.1787: (2008) |
| 4 |  | Irit Dinur,
Elena Grigorescu,
Swastik Kopparty,
Madhu Sudan:
Decodability of Group Homomorphisms beyond the Johnson Bound.
Electronic Colloquium on Computational Complexity (ECCC) 15(020): (2008) |
| 3 |  | Elena Grigorescu,
Tali Kaufman,
Madhu Sudan:
2-Transitivity is Insufficient for Local Testability.
Electronic Colloquium on Computational Complexity (ECCC) 15(033): (2008) |
| 2006 |
| 2 |  | Elena Grigorescu,
Swastik Kopparty,
Madhu Sudan:
Local Decoding and Testing for Homomorphisms.
APPROX-RANDOM 2006: 375-385 |
| 2004 |
| 1 |  | Elena Grigorescu:
The insulation sequence of a graph.
Discrete Applied Mathematics 134(1-3): 77-90 (2004) |