Join Our Newsletter

STOC

2009

ACM

9 years 11 months ago
2009

ACM

We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...

STOC

2009

ACM

9 years 11 months ago
2009

ACM

This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...

STOC

2009

ACM

9 years 11 months ago
2009

ACM

We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...

STOC

2009

ACM

9 years 11 months ago
2009

ACM

The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...

STOC

2009

ACM

9 years 11 months ago
2009

ACM

We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...

STOC

2009

ACM

9 years 11 months ago
2009

ACM

Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...

STOC

2009

ACM

9 years 11 months ago
2009

ACM

The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...

STOC

2009

ACM

9 years 11 months ago
2009

ACM

We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradig...

STOC

2009

ACM

9 years 11 months ago
2009

ACM

We initiate a systematic study of a special type of property testers. These testers consist of repeating a basic test for a number of times that depends on the proximity parameter...

STOC

2009

ACM

9 years 11 months ago
2009

ACM

We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...