Sciweavers

PODC
2015
ACM
9 years 8 months ago
Algebraic Methods in the Congested Clique
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...
Keren Censor-Hillel, Petteri Kaski, Janne H. Korho...
PODC
2015
ACM
9 years 8 months ago
Fault-Tolerant Consensus in Directed Graphs
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...
Lewis Tseng, Nitin H. Vaidya
PODC
2015
ACM
9 years 8 months ago
The Weakest Failure Detector for Eventual Consistency
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...
Swan Dubois, Rachid Guerraoui, Petr Kuznetsov, Fra...
PODC
2015
ACM
9 years 8 months ago
Trading Fences with RMRs and Separating Memory Models
Hagit Attiya, Danny Hendler, Philipp Woelfel
PODC
2015
ACM
9 years 8 months ago
Distributed House-Hunting in Ant Colonies
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 ...
Mohsen Ghaffari, Cameron Musco, Tsvetomira Radeva,...
Distributed And Parallel Computing
Top of PageReset Settings