STOC
2004
ACM
15 years 9 months ago
2004
ACM
STOC
2004
ACM
15 years 9 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
STOC
2004
ACM
15 years 9 months ago
2004
ACM
STOC
2004
ACM
15 years 9 months ago
2004
ACM
STOC
2004
ACM
15 years 9 months ago
2004
ACM
STOC
2004
ACM
15 years 9 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
STOC
2004
ACM
15 years 9 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
STOC
2004
ACM
15 years 9 months ago
2004
ACM
STOC
2004
ACM
15 years 9 months ago
2004
ACM
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a...
STOC
2004
ACM
15 years 9 months ago
2004
ACM
We continue the study of the trade-off between the length of PCPs and their query complexity, establishing the following main results (which refer to proofs of satisfiability of c...