Sciweavers

Share
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
9 years 11 months ago
On the convergence of regret minimization dynamics in concave games
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
Eyal Even-Dar, Yishay Mansour, Uri Nadav
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
9 years 11 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
9 years 11 months ago
An axiomatic approach to algebrization
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
Russell Impagliazzo, Valentine Kabanets, Antonina ...
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
9 years 11 months ago
Random graphs and the parity quantifier
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
Phokion G. Kolaitis, Swastik Kopparty
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
9 years 11 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
9 years 11 months ago
An efficient algorithm for partial order production
Gwenaël Joret, J. Ian Munro, Jean Cardinal, R...
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
9 years 11 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
9 years 11 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
9 years 11 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
STOC
2009
ACM
187views Algorithms» more  STOC 2009»
9 years 11 months ago
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
Venkatesan Guruswami
books