148
click to vote
PODC
9 years 8 months ago
2015 ACM
In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multipl...
PODC
9 years 8 months ago
2015 ACM
Consider a point-to-point network in which nodes are connected by directed links. This paper proves tight necessary and sufficient conditions on the underlying communication graph...
PODC
9 years 8 months ago
2015 ACM
In its classical form, a consistent replicated service requires all replicas to witness the same evolution of the service state. Assuming a message-passing environment with a majo...
PODC
9 years 8 months ago
2015 ACM PODC
9 years 8 months ago
2015 ACM
We introduce the study of the ant colony house-hunting problem from a distributed computing perspective. When an ant colony’s nest becomes unsuitable due to size constraints or ...
|