S. Heller, M. Herlihy, V. Luchangco, M. Moir, W. N. Scherer et al., A lazy concurrent list-based set algorithm, In: OPODIS, pp.3-16, 2006.
DOI : 10.1007/11795490_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.8911

V. Gramoli, P. Kuznetsov, S. Ravi, and D. Shang, A concurrency-optimal list-based set, p.arXiv, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01207872

T. L. Harris, A Pragmatic Implementation of Non-blocking Linked-lists, In: DISC, pp.300-314, 2001.
DOI : 10.1007/3-540-45414-4_21

M. M. Michael, High performance dynamic lock-free hash tables and list-based sets, Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '02, pp.73-82, 2002.
DOI : 10.1145/564870.564881

H. Attiya, E. Hillel, and A. Milani, Inherent limitations on disjoint-access parallel implementations of transactional memory, In: SPAA, pp.69-78, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00992693

R. Guerraoui and M. Kapalka, Principles of Transactional Memory. Synthesis Lectures on Distributed Computing Theory, 2010.
DOI : 10.2200/s00253ed1v01y201009dct004

F. Ellen, P. Fatourou, E. Kosmas, A. Milani, and C. Travers, Universal constructions that ensure disjoint-access parallelism and wait-freedom, Distributed Computing, vol.26, issue.4, pp.115-124, 2012.
DOI : 10.1007/s00446-015-0261-8
URL : https://hal.archives-ouvertes.fr/hal-00992681