STOC
2003
ACM
13 years 9 months ago
2003
ACM
We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian d...
STOC
2003
ACM
13 years 9 months ago
2003
ACM
STOC
2003
ACM
13 years 9 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
STOC
2003
ACM
14 years 4 months ago
2003
ACM
STOC
2003
ACM
14 years 4 months ago
2003
ACM
STOC
2003
ACM
14 years 4 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...