47 search results - page 2 / 10 » podc 2010 |
PODC
2010
ACM
13 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...
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...
PODC
2010
ACM
13 years 5 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 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...
PODC
2010
ACM
13 years 8 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...