STOC
2002
ACM
14 years 12 months ago
2002
ACM
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
STOC
2002
ACM
14 years 12 months ago
2002
ACM
STOC
2002
ACM
14 years 12 months ago
2002
ACM
STOC
2002
ACM
14 years 12 months ago
2002
ACM
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
STOC
2002
ACM
14 years 12 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...