Sciweavers

FOCS
2009
IEEE
13 years 10 months ago
Oblivious Routing for the Lp-norm
Matthias Englert, Harald Räcke
FOCS
2009
IEEE
13 years 10 months ago
Decomposing Coverings and the Planar Sensor Cover Problem
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 ...
Matt Gibson, Kasturi R. Varadarajan
FOCS
2009
IEEE
13 years 10 months ago
Models for the Compressible Web
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
FOCS
2009
IEEE
13 years 10 months ago
Bit Encryption Is Complete
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...
Steven Myers, Abhi Shelat
FOCS
2009
IEEE
13 years 10 months ago
Planarity Allowing Few Error Vertices in Linear Time
— 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...
Ken-ichi Kawarabayashi
FOCS
2009
IEEE
13 years 10 months ago
Constraint Satisfaction Problems of Bounded Width
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...
Libor Barto, Marcin Kozik