Sciweavers

STOC
2012
ACM
201views Algorithms» more  STOC 2012»
13 years 8 months ago
From irreducible representations to locally decodable codes
Locally Decodable Code (LDC) is a code that encodes a message in a way that one can decode any particular symbol of the message by reading only a constant number of locations, eve...
Klim Efremenko
STOC
2012
ACM
185views Algorithms» more  STOC 2012»
13 years 8 months ago
Subspace evasive sets
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
Zeev Dvir, Shachar Lovett
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 8 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
169
Voted
STOC
2012
ACM
222views Algorithms» more  STOC 2012»
13 years 8 months ago
An analysis of one-dimensional schelling segregation
We analyze the Schelling model of segregation in which a society of n individuals live in a ring. Each individual is one of two races and is only satisfied with his location so l...
Christina Brandt, Nicole Immorlica, Gautam Kamath,...
179
Voted
STOC
2012
ACM
219views Algorithms» more  STOC 2012»
13 years 8 months ago
Prior-free auctions with ordered bidders
Stefano Leonardi, Tim Roughgarden