Sciweavers

158
Voted
PODC
2015
ACM
9 years 9 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...
105
Voted
PODC
2015
ACM
9 years 9 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
101
Voted
PODC
2015
ACM
9 years 9 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...
98
Voted
PODC
2015
ACM
9 years 9 months ago
Trading Fences with RMRs and Separating Memory Models
Hagit Attiya, Danny Hendler, Philipp Woelfel
96
Voted
PODC
2015
ACM
9 years 9 months ago
Brief Announcement: Fault-tolerant Broadcast in Anonymous Distributed Systems with Fair Lossy Communication Channels
Fault-tolerant broadcast is a fundamental service in distributed systems, by which processes can communicate with each other consistently and reliably. It has two main forms: Reli...
Jian Tang, Mikel Larrea, Sergio Arévalo, Er...
Distributed And Parallel Computing
Top of PageReset Settings