 | 2009 |
|---|
| 11 |       | Elena Grigorescu,
Tali Kaufman,
Madhu Sudan:
Succinct Representation of Codes with Applications to Testing.
APPROX-RANDOM 2009: 534-547 |
| 10 | | Arnab Bhattacharyya,
Elena Grigorescu,
Kyomin Jung,
Sofya Raskhodnikova,
David P. Woodruff:
Transitive-closure spanners.
SODA 2009: 932-941 |
| 9 | | Elena Grigorescu,
Tali Kaufman,
Madhu Sudan:
Succinct Representation of Codes with Applications to Testing
CoRR abs/0905.2919: (2009) |
| 8 | | Victor Chen,
Elena Grigorescu,
Ronald de Wolf:
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
CoRR abs/0909.3696: (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) |
