SPAA
2004
ACM
14 years 1 months ago
2004
ACM
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
PODC
2004
ACM
14 years 1 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
PODC
2004
ACM
14 years 1 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
PODC
2004
ACM
14 years 1 months ago
2004
ACM
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
PODC
2004
ACM
14 years 1 months ago
2004
ACM
PODC
2004
ACM
14 years 1 months ago
2004
ACM
PODC
2004
ACM
14 years 1 months ago
2004
ACM
PODC
2004
ACM
14 years 1 months ago
2004
ACM
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...