PODC
2010
ACM
13 years 2 months ago
2010
ACM
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...
PODC
2010
ACM
13 years 2 months ago
2010
ACM
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
PODC
2010
ACM
13 years 4 months ago
2010
ACM
PODC
2010
ACM
13 years 4 months ago
2010
ACM
Multiparty computation (MPC) protocols among n parties secure against t active faults are known to exist if and only if
PODC
2010
ACM
13 years 4 months ago
2010
ACM
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
PODC
2010
ACM
13 years 4 months ago
2010
ACM
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
PODC
2010
ACM
13 years 4 months ago
2010
ACM
PODC
2010
ACM
13 years 6 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
PODC
2010
ACM
13 years 6 months ago
2010
ACM
PODC
2010
ACM
13 years 6 months ago
2010
ACM
We present a single-version STM that satisfies a practical notion of permissiveness: it never aborts read-only transactions, and it only aborts an update transaction due to anothe...