STOC
2001
ACM
15 years 4 months ago
2001
ACM
STOC
2001
ACM
15 years 4 months ago
2001
ACM
d Abstract] Shai Halevi Robert Krauthgamer Eyal Kushilevitz Kobbi Nissim ? The notion of private approximation was introduced recently by Feigenbaum, Fong, Strauss and Wright. Inf...
STOC
2001
ACM
15 years 4 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
STOC
2001
ACM
15 years 4 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
STOC
2001
ACM
15 years 4 months ago
2001
ACM
STOC
2001
ACM
15 years 4 months ago
2001
ACM
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
STOC
2001
ACM
15 years 4 months ago
2001
ACM
STOC
2001
ACM
15 years 4 months ago
2001
ACM
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
STOC
2001
ACM
15 years 4 months ago
2001
ACM
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
STOC
2001
ACM
15 years 4 months ago
2001
ACM
