145
click to vote
PODC
15 years 6 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 ...
156
click to vote
PODC
15 years 6 months ago
2010 ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
102
click to vote
PODC
15 years 6 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...
121
click to vote
PODC
15 years 6 months ago
2010 ACM
Concurrent collection classes are widely used in multi-threaded programming, but they provide atomicity only for a fixed set of operations. Software transactional memory (STM) pr...
110
click to vote
PODC
15 years 6 months ago
2010 ACM 
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
|
Distributed And Parallel Computing