Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
PODC
2010
ACM
10 years 2 months ago
Brief announcement: distributed contention resolution in wireless networks
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 ...
Thomas Kesselheim, Berthold Vöcking
PODC
2010
ACM
10 years 2 months ago
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
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...
Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowals...
PODC
2010
ACM
10 years 4 months ago
Non-blocking binary search trees
Faith Ellen, Panagiota Fatourou, Eric Ruppert, Fra...
PODC
2010
ACM
10 years 4 months ago
On the theoretical gap between synchronous and asynchronous MPC protocols
Multiparty computation (MPC) protocols among n parties secure against t active faults are known to exist if and only if
Zuzana Beerliová-Trubíniová, ...
PODC
2010
ACM
10 years 4 months ago
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
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...
Robert Danek
PODC
2010
ACM
10 years 4 months ago
Brief announcement: swarming secrets
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...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
PODC
2010
ACM
10 years 4 months ago
On utilizing speed in networks of mobile agents
Joffroy Beauquier, Janna Burman, Julien Clement, S...
PODC
2010
ACM
10 years 6 months ago
Brief announcement: efficient graph algorithms without synchronization
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...
Johannes Schneider, Roger Wattenhofer
PODC
2010
ACM
10 years 6 months ago
Brief announcement: single-version permissive STM
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...
Hagit Attiya, Eshcar Hillel
books