#### Filter Results:

- Full text PDF available (54)

#### Publication Year

1960

2017

- This year (6)
- Last 5 years (31)
- Last 10 years (53)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn 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)

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,EH) 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)

- 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)

- 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 any… (More)

- Victor Chen, Elena Grigorescu, Ronald de Wolf
- SIAM J. Comput.
- 2009

We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries about the object, even if the data structure has been corrupted by a constant fraction of errors. We measure the efficiency of a data structure in terms of its length (the number… (More)

- Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan
- Electronic Colloquium on Computational Complexity
- 2008

Given a pair of finite groups G and H, the set of homomorphisms from G to H form an error-correcting code where codewords differ in at least 1/2 the coordinates. We show that for every pair of <i>abelian</i> groups G and H, the resulting code is (locally) list-decodable from a fraction of errors arbitrarily close to its distance. At the heart of this result… (More)

- 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, Chris Peikert
- computational complexity
- 2011

The question of list-decoding error-correcting codes over finite fields (under the Hamming metric) has been widely studied in recent years. Motivated by the similar discrete linear structure of linear codes and point lattices in $${\mathbb{R}^{N}}$$ R N , and their many shared applications across complexity theory, cryptography, and coding theory, we… (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 F2n for prime n,… (More)