Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

PODC
2004
ACM

favoriteEmaildiscussreport

85views Distributed And Parallel Com...» more PODC 2004»

The weakest failure detectors to solve certain fundamental problems in distributed computing

14 years 1 months ago

The weakest failure detectors to solve certain fundamental problems in distributed computing

Download lpdwww.epfl.ch

Carole Delporte-Gallet, Hugues Fauconnier, Rachid

Real-time Traffic

Distributed And Parallel Computing | PODC 2004 |

claim paper

Related Content

» The weakest failure detector for solving kset agreement

» Consensus in Anonymous Distributed Systems Is There a Weakest Failure Detector

» The weakest failure detector for waitfree dining under eventual weak exclusion

» The Weakest Failure Detector for Solving Consensus

» A Realistic Look At Failure Detectors

» Asynchronous failure detectors

» Unreliable Failure Detectors via Operational Semantics

» Brief Announcement The Minimum Failure Detector for NonLocal Tasks in MessagePassing Syste...

» Anonymous Asynchronous Systems The Case of Failure Detectors

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	PODC
Authors	Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos, Petr Kouznetsov, Sam Toueg

Comments (0)