STOC
2012
ACM
11 years 11 months ago
2012
ACM
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
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...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
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...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
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...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
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...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
TACAS
2012
Springer
12 years 4 months ago
2012
Springer
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
TACAS
2012
Springer
12 years 4 months ago
2012
Springer
Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomou...
TACAS
2012
Springer
12 years 4 months ago
2012
Springer
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...