#### Filter Results:

- Full text PDF available (52)

#### Publication Year

1960

2017

- This year (3)
- Last five years (30)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We define the notion of a transitive-closure spanner of a directed graph. Given a directed graph G = (V, E) and an integer k ≥ 1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, E H) that has (1) the same transitive-closure as G and (2) diameter at most k. These spanners were studied implicitly in access control, property… (More)

- Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira
- 2010 IEEE 51st Annual Symposium on Foundations of…
- 2010

There has been a sequence of recent papers devoted to understanding the relation between the testability of properties of Boolean functions and the invariance of the properties with respect to transformations of the domain. Invariance with respect to F_2-linear transformations is arguably the most common such symmetry for natural properties of Boolean… (More)

- Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao
- J. ACM
- 2013

We introduce a framework for proving lower bounds on computational problems over distributions against algorithms that can be implemented using access to a <i>statistical query</i> oracle. For such algorithms, access to the input distribution is limited to obtaining an estimate of the expectation of any given function on a sample drawn randomly from the… (More)

- Elena Grigorescu, Lev Reyzin, Santosh Vempala
- ALT
- 2011

We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , 1 1−2η n (1+(2η) 2 +o(1))r/2 and uses only r log(n/δ)ω(1) (1−2η) 2 samples in the random noise setting under the uniform distribution, where η is the noise rate and δ is the… (More)

- Elena Grigorescu
- 2010

- Elena Grigorescu, Tali Kaufman
- IEEE Transactions on Information Theory
- 2012

We exhibit explicit bases for BCH codes of designed distance 5. While BCH codes are some of the most studied families of codes, only recently Kaufman and Litsyn (FOCS, 2005) showed that they admit bases of small weight codewords. Fur thermore, Grigorescu, Kaufman, and Sudan (RANDOM, 2009) and Kaufman and Lovett (FOCS, 2011) proved that, in fact, BCH codes… (More)

- Elena Grigorescu, Tali Kaufman, Madhu Sudan
- Electronic Colloquium on Computational Complexity
- 2009

Motivated by questions in property testing, we search for linear error-correcting codes that have the " single local orbit " property: i.e., they are specified by a single local constraint and its translations under the symmetry group of the code. We show that the dual of every " sparse " binary code whose coordinates are indexed by elements of F 2 n for… (More)

- Elena Grigorescu, Tali Kaufman, Madhu Sudan
- computational complexity
- 2008

A basic goal in property testing is to identify a minimal set of features that make a property testable. For the case when the property to be tested is membership in a binary linear error-correcting code, Alon et al. (Trans Inf Theory, 51(11):4032–4039, 2005) had conjectured that the presence of a single low-weight codeword in the dual, and “2-transitivity”… (More)

- Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan
- Electronic Colloquium on Computational Complexity
- 2011

Affine-invariant properties are an abstract class of properties that generalize some central algebraic ones, such as linearity and low-degree-ness, that have been studied extensively in the context of property testing. Affine invariant properties consider functions mapping a big field F q n to the subfield F q and include all properties that form an F… (More)

- Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao
- Electronic Colloquium on Computational Complexity
- 2012

We develop a framework for proving lower bounds on computational problems over distributions , including optimization and unsupervised learning. Our framework is based on defining a restricted class of algorithms, called statistical algorithms, that instead of accessing samples from the input distribution can only obtain an estimate of the expectation of… (More)