Sciweavers

Share
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
9 years 11 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
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...
Marek Karpinski, Warren Schudy
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
9 years 11 months ago
An improved constant-time approximation algorithm for maximum~matchings
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...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
STOC
2009
ACM
119views Algorithms» more  STOC 2009»
9 years 11 months ago
Explicit construction of a small epsilon-net for linear threshold functions
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...
Yuval Rabani, Amir Shpilka
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
9 years 11 months ago
New direct-product testers and 2-query PCPs
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...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
9 years 11 months ago
Polynomial-time theory of matrix groups
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...
László Babai, Robert Beals, Á...
STOC
2009
ACM
224views Algorithms» more  STOC 2009»
9 years 11 months ago
3-query locally decodable codes of subexponential length
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...
Klim Efremenko
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
9 years 11 months ago
Intrinsic robustness of the price of anarchy
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...
Tim Roughgarden
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
9 years 11 months ago
Differential privacy and robust statistics
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...
Cynthia Dwork, Jing Lei
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
9 years 11 months ago
On proximity oblivious testing
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...
Oded Goldreich, Dana Ron
STOC
2009
ACM
161views Algorithms» more  STOC 2009»
9 years 11 months ago
List decoding tensor products and interleaved codes
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...
Parikshit Gopalan, Venkatesan Guruswami, Prasad Ra...
books