126
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
This paper addresses partial information spreading among n nodes of a network. As opposed to traditional information spreading, where each node has a message that must be received...
106
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
129
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We present view transactions, a model for relaxed consistency checks in software transactional memory (STM). View transactions always operate on a consistent snapshot of memory bu...
144
click to vote
ESWS
2007
Springer
15 years 8 months ago
2007
Springer
The semantic web vision will facilitate automation of many tasks, including the location and dynamic reconfiguration of web services. In this article, we are concerned with a speci...
135
Voted
PODC
2010
ACM
15 years 8 months ago
2010
ACM
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...