FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
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...
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
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...
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
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...
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
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...
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
We initiate the study of testing properties of images that correspond to sparse 0/1-valued matrices of size n
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
