M. R. Achour-mostéfaoui and M. Perrin, A simple object that spans the whole consensus hierarchy, Parallel Processing Letters, 2018.

Y. Afek, E. Gafni, and A. Morrison, Common2 extended to stacks and unbounded concurrency, Distributed Computing, vol.20, issue.4, pp.239-252, 2007.

Y. Afek, E. Weisberger, and H. Weisman, A completeness theorem for a class of synchronization objects, PODC, pp.159-170, 1993.

J. Aspnes and M. Herlihy, Wait-free data structures in the asynchronous pram model, SPAA, pp.340-349, 1990.

H. Attiya, A. Castañeda, and D. Hendler, Nontrivial and universal helping for wait-free queues and stacks, OPODIS, 2015.

K. Censor-hillel, E. Petrank, and S. Timnat, Help! In PODC, pp.241-250, 2015.

O. Denysyuk and P. Woelfel, Wait-freedom is harder than lock-freedom under strong linearizability, DISC, pp.60-74, 2015.
DOI : 10.1007/978-3-662-48653-5_5
URL : https://hal.archives-ouvertes.fr/hal-01199821

F. Ellen, R. Gelashvili, N. Shavit, and L. Zhu, A complexity-based hierarchy for multiprocessor synchronization, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pp.289-298, 2016.

W. Golab, L. Higham, and P. Woelfel, Linearizable implementations do not suffice for randomized distributed computation, STOC, pp.373-382, 2011.

M. Herlihy, Impossibility results for asynchronous pram, SPAA, pp.327-336, 1991.

M. Herlihy, Wait-free synchronization, ACM Trans. Prog. Lang. Syst, vol.13, issue.1, pp.124-149, 1991.

M. P. Herlihy and J. M. Wing, Linearizability: A correctness condition for concurrent objects, ACM Trans. Prog. Lang. Syst, vol.12, issue.3, pp.463-492, 1990.

A. Kogan and E. Petrank, A methodology for creating fast wait-free data structures, PPoPP, pp.141-150, 2012.

M. Perrin, A. Mostefaoui, and J. Claude, Causal consistency: beyond memory, Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01286755