FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...