Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt et al., Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993.
DOI : 10.1145/153724.153741

H. Attiya, A. Bar-noy, and D. Dolev, Sharing memory robustly in message-passing systems, Journal of the ACM, vol.42, issue.1, pp.124-142, 1995.
DOI : 10.1145/200836.200869

B. Awerbuch, Complexity of network synchronization, Journal of the ACM, vol.32, issue.4, pp.804-823, 1985.
DOI : 10.1145/4221.4227

E. Borowsky and E. Gafni, Immediate atomic snapshots and fast renaming, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing , PODC '93, pp.41-51, 1993.
DOI : 10.1145/164051.164056

E. Borowsky and E. Gafni, -resilient asynchronous computations, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.91-100, 1993.
DOI : 10.1145/167088.167119
URL : https://hal.archives-ouvertes.fr/hal-00896459

E. Borowsky and E. Gafni, A Simple Algorithmically Reasoned Characterization of Wait-free Computations, Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC'97, pp.189-198, 1997.

E. Borowsky, E. Gafni, N. Lynch, and S. Rajsbaum, The BG distributed simulation algorithm, Distributed Computing, vol.14, issue.3, pp.127-146, 2001.
DOI : 10.1007/PL00008933

O. Biran, S. Moran, and S. Zaks, A combinatorial characterization of the distributed 1-solvable tasks, Journal of Algorithms, vol.11, issue.3, pp.420-440, 1990.
DOI : 10.1016/0196-6774(90)90020-F

T. Chandra and S. Toueg, Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996.
DOI : 10.1145/226643.226647

T. Chandra, V. Hadzilacos, and S. Toueg, The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996.
DOI : 10.1145/234533.234549

S. Chaudhuri, More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993.
DOI : 10.1006/inco.1993.1043

W. Chen, J. Zhang, Y. Chen, and X. Liu, Weakening Failure Detectors for k-Set Agreement via the Partition Approach Proc, 21st Int'l Symposium on Distributed Computing (DISC'07), pp.123-138, 2007.

C. Dwork, N. Lynch, and L. Stockmeyer, Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988.
DOI : 10.1145/42282.42283

M. J. Fischer, N. A. Lynch, and M. S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985.
DOI : 10.1145/3149.214121

E. Gafni, Round-by-round Fault Detectors: Unifying Synchrony and Asynchrony, Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC'00), pp.143-152, 1998.
DOI : 10.1145/277697.277724

E. Gafni, S. Rajsbaum, and M. Herlihy, Subconsensus Tasks: Renaming Is Weaker Than Set Agreement, Proc. 20th Int'l Symposium on Distributed Computing (DISC'06), pp.329-338, 2006.
DOI : 10.1007/11864219_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.4954

R. Guerraoui and A. Schiper, Gamma-accurate Failure Detectors, Proc. 1Oth Int'l Workshop on Distributed Algorithms (WDAG'96), pp.269-286, 1996.
DOI : 10.1007/3-540-61769-8_18

M. P. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991.
DOI : 10.1145/114005.102808

M. P. Herlihy and L. D. Penso, Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors, Distributed Computing, pp.157-166, 2005.

M. P. Herlihy, S. Rajsbaum, and M. Tuttle, Unifying synchronous and asynchronous message-passing models, Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, pp.133-142, 1998.
DOI : 10.1145/277697.277722
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.448

M. P. Herlihy and N. Shavit, The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999.
DOI : 10.1145/331524.331529

I. Keidar and A. Shraer, Timeliness, failure-detectors, and consensus performance, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.169-178, 2006.
DOI : 10.1145/1146381.1146408
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.401

L. Lamport and N. Lynch, Distributed Computing: Models and Methods. Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pp.1157-1199, 1990.

N. A. Lynch, Distributed Algorithms, 1997.

Y. Moses and S. Rajsbaum, A Layered Analysis of Consensus, SIAM Journal on Computing, vol.31, issue.4, pp.989-1021, 2002.
DOI : 10.1137/S0097539799364006

A. Mostefaoui, S. Rajsbaum, M. Raynal, and C. Travers, On the Computability Power and the Robustness of Set Agreementoriented Failure Detector Classes Extended abstract: Irreducibility and Additivity of Set Agreement-oriented Failure Detector Classes, Proc. PODC'06, pp.153-162, 2006.

A. Mostefaoui and M. Raynal, Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus, Proc. 19th Int'l Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'99) Springer Verlag LNCS #1738, pp.329-340, 1999.
DOI : 10.1007/3-540-46691-6_26

G. Neiger and S. Linearizability, Brief Announcement, Proc. 13th ACM Symposium on Principles of Distributed Computing (PODC'94, p.396, 1994.

G. Neiger, Failure Detectors and the Wait-free Hierarchy, Proc. 14th ACM Symposium on Principles of Distributed Computing (PODC'95, pp.100-109, 1995.

S. Rajsbaum, M. Raynal, and C. Travers, Failure Detectors as Schedulers (An Algorithmically-Reasoned Characterization), 2007.
URL : https://hal.archives-ouvertes.fr/inria-00139317

M. Saks and F. Zaharoglou, -set agreement is impossible, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.1449-1483, 2000.
DOI : 10.1145/167088.167122
URL : https://hal.archives-ouvertes.fr/hal-00192526

H. Völzer, On Conspiracies and Hyperfairness in Distributed Computing, Proc. 19th Int'l Symposium on Distributed Computing (DISC'05), pp.33-47, 2005.
DOI : 10.1007/11561927_5

J. Yang, G. Neiger, and E. Gafni, Structured derivations of consensus algorithms for failure detectors, Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, pp.297-308, 1998.
DOI : 10.1145/277697.277755

P. Zieli´nskizieli´nski, Anti-Omega: the weakest failure detector for set agreement, 2007.