Y. Afek, E. Gafni, S. Rajsbaum, M. Raynal, and T. C. , The k-simultaneous consensus problem, Distributed Computing, vol.29, issue.5, pp.185-195, 2010.
DOI : 10.1007/s00446-009-0090-8
URL : https://hal.archives-ouvertes.fr/inria-00354248

J. H. Anderson and M. Moir, Universal constructions for large objects, IEEE Transactions on Parallel and Distributed Systems, vol.10, issue.12, pp.1317-1332, 1999.
DOI : 10.1109/71.819952
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.5007

H. Attiya, R. Guerraoui, D. Hendler, and P. Kutnetsov, The complexity of obstruction-free implementations, Article 24, 2009.
DOI : 10.1145/1538902.1538908

H. Attiya and J. L. Welch, Distributed computing: fundamentals, simulations and advanced topics, Wiley-Interscience, 414 pages, 2004.
DOI : 10.1002/0471478210

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

Z. Bouzid and C. Travers, Simultaneous consensus is harder than set agreement in message-passing, Proc. 33rd Int'l IEEE Conference on Distributed Computing Systems (ICDCS'13), pp.611-620, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00752610

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

C. Ph, F. Ellen, and V. Ramachandran, A Universal construction for wait-free transaction friendly data structures, Proc. 22th Int'l ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'10), pp.335-344, 2010.

T. Crain, D. Imbs, and M. , Towards a universal construction for transaction-based multiprocess programs, Theoretical Computer Science, vol.496, pp.154-169, 2013.
DOI : 10.1016/j.tcs.2012.09.011
URL : https://hal.archives-ouvertes.fr/inria-00576755

F. Ellen, P. Fatourou, E. Kosmas, A. Milani, and T. C. , Universal construction that ensure disjoint-access parallelism and wait-freedom
DOI : 10.1145/2332432.2332457
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.397.5278

P. Fatourou and N. D. Kallimanis, A highly-efficient wait-free universal construction, Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, SPAA '11, pp.325-334, 2012.
DOI : 10.1145/1989493.1989549

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), pp.143-152, 1998.

R. Guerraoui, M. Kapalka, and P. Kouznetsov, The weakest failure detectors to boost obstruction-freedom, Distributed Computing, vol.53, issue.7, pp.415-433, 2008.
DOI : 10.1007/s00446-007-0046-9

R. Guerraoui and N. A. Lynch, A general characterization of indulgence, ACM Transactions on Autonomous and Adaptive Systems, vol.3, issue.20, 2008.

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, V. Luchangco, and M. Moir, Obstruction-free synchronization: double-ended queues as an example, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., pp.522-529, 2003.
DOI : 10.1109/ICDCS.2003.1203503
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.180.1070

M. Herlihy, V. Luchangco, M. Moir, and I. W. Scherer, Software transactional memory for dynamic-sized data structures, Proceedings of the twenty-second annual symposium on Principles of distributed computing , PODC '03, pp.92-101, 2003.
DOI : 10.1145/872035.872048
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.1147

M. P. Herlihy and J. E. Moss, Transactional memory: architectural support for lock-free data structures, Proc. 20th ACM Int'l Symposium on Computer Architecture (ISCA'93), pp.289-300, 1993.

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

M. P. Herlihy and J. M. Wing, Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990.
DOI : 10.1145/78969.78972

L. Lamport, On inter-process communications, Part I: Basic formalism, Distributed Computing, pp.77-85, 1986.

M. Loui and H. Abu-amara, Memory requirements for agreement among unreliable asynchronous processes, Advances in Computing Research, pp.163-183, 1987.

N. A. Lynch, Distributed algorithms, 1996.

V. Luchangco, M. Moir, and N. Shavit, On the Uncontended Complexity of Consensus, Proc. 17th Int'l Symposium on Distributed Computing (DISC'03), Springer LNCS 2848, pp.45-59, 2003.
DOI : 10.1007/978-3-540-39989-6_4

M. Merritt and G. Taubenfeld, Resilient Consensus for Infinitely Many Processes, Proc. 17th Int'l Symposium on Distributed Computing (DISC'03), Springer LNCS 2848, pp.1-15, 2003.
DOI : 10.1007/978-3-540-39989-6_1

M. Raynal, Concurrent programming: algorithms, principles, and foundations, p.2013
DOI : 10.1007/978-3-642-32027-9
URL : https://hal.archives-ouvertes.fr/hal-00922217

M. Raynal and J. Stainer, Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems, Proc. 20th Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO 2013), Springer LNCS 8179, pp.298-309, 2013.
DOI : 10.1137/S0097539796307698
URL : https://hal.archives-ouvertes.fr/hal-00787992

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

N. Shavit and D. Touitou, Software transactional memory, Distributed Computing, pp.99-116, 1997.

G. Taubenfeld, Contention-sensitive data structure and algorithms, Proc. 23rd Int'l Symposium on Distributed Computing (DISC'09), Springer LNCS 5805, pp.157-171, 2009.