Sciweavers

FOCS
2010
IEEE
13 years 8 months ago
Minimum-Cost Network Design with (Dis)economies of Scale
Given a network, a set of demands and a cost function f(
Matthew Andrews, Spyridon Antonakopoulos, Lisa Zha...
FOCS
2010
IEEE
13 years 9 months ago
On the Insecurity of Parallel Repetition for Leakage Resilience
A fundamental question in leakage-resilient cryptography is: can leakage resilience always be amplified by parallel repetition? It is natural to expect that if we have a leakage-r...
Allison B. Lewko, Brent Waters
FOCS
2010
IEEE
13 years 9 months ago
Replacement Paths via Fast Matrix Multiplication
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
Oren Weimann, Raphael Yuster
FOCS
2010
IEEE
13 years 9 months ago
A Fourier-Analytic Approach to Reed-Muller Decoding
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
Parikshit Gopalan
FOCS
2010
IEEE
13 years 9 months ago
A Non-linear Lower Bound for Planar Epsilon-Nets
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
Noga Alon
FOCS
2010
IEEE
13 years 9 months ago
Improved Bounds for Geometric Permutations
Natan Rubin, Haim Kaplan, Micha Sharir
FOCS
2010
IEEE
13 years 9 months ago
Testing Properties of Sparse Images
We initiate the study of testing properties of images that correspond to sparse 0/1-valued matrices of size n
Gilad Tsur, Dana Ron
FOCS
2010
IEEE
13 years 9 months ago
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs
Irit Dinur, Subhash Khot, Will Perkins, Muli Safra