FOCS
2009
IEEE
14 years 7 months ago
2009
IEEE
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...
FOCS
2009
IEEE
14 years 7 months ago
2009
IEEE
FOCS
2009
IEEE
14 years 7 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
FOCS
2009
IEEE
14 years 7 months ago
2009
IEEE
FOCS
2009
IEEE
14 years 7 months ago
2009
IEEE
Abstract— Under CPA and CCA1 attacks, a secure bit encryption scheme can be applied bit-by-bit to construct a secure many-bit encryption scheme. The same construction fails, howe...
FOCS
2009
IEEE
14 years 7 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
FOCS
2009
IEEE
14 years 7 months ago
2009
IEEE
We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conje...
STACS
2009
Springer
14 years 7 months ago
2009
Springer
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
STACS
2009
Springer
14 years 7 months ago
2009
Springer
STACS
2009
Springer
14 years 7 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...