Brief announcement: on the meaning of solving a task with a failure detector

Authors:
Carole Delporte-Gallet;Hugues Fauconnier;Eli Gafni;Petr Kuznetsov
Affiliations:
University Paris Diderot;University Paris Diderot;Computer Science Department, University of California, Los Angeles;TU Berlin/Deutsche Telekom Laboratories, Berlin, Germany
Venue:
DISC'11 Proceedings of the 25th international conference on Distributed computing
Year:
2011

Generalized FLP impossibility result for t-resilient asynchronous computations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
Failure detectors in loosely named systems

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Tight failure detection bounds on atomic object implementations

Journal of the ACM (JACM)
The disagreement power of an adversary

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Turning adversaries into friends: simplified, made constructive, and extended

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems

Hi-index	0.00