H. Attiya, R. Guerraoui, D. Hendler, and P. Kuznetsov, The complexity of obstruction-free implementations, Journal of the ACM, vol.56, issue.4, 2009.
DOI : 10.1145/1538902.1538908

H. Attiya, R. Guerraoui, D. Hendler, P. Kuznetsov, M. Michael et al., Laws of order: Expensive synchronization in concurrent algorithms cannot be eliminated, POPL, pp.487-498, 2011.

H. Attiya and E. Hillel, The Cost of Privatization in Software Transactional Memory, IEEE Transactions on Computers, vol.62, issue.12, pp.2531-2543, 2013.
DOI : 10.1109/TC.2012.159

H. Attiya, E. Hillel, and A. Milani, Inherent limitations on disjoint-access parallel implementations of transactional memory. Theory of Computing Systems, pp.698-719, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00992693

L. Dalessandro, M. F. Spear, and M. L. Scott, NOrec: streamlining STM by abolishing ownership records, PPOPP, pp.67-78, 2010.

D. Dice, O. Shalev, and N. Shavit, Transactional Locking II, DISC, pp.194-208, 2006.
DOI : 10.1007/11864219_14

D. Dice and N. Shavit, What really makes transactions fast? In Transact, 2006.

D. Dice and N. Shavit, TLRW, Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures, SPAA '10, pp.284-293, 2010.
DOI : 10.1145/1810479.1810531

F. Ellen, D. Hendler, and N. Shavit, On the Inherent Sequentiality of Concurrent Objects, SIAM Journal on Computing, vol.41, issue.3, pp.519-536, 2012.
DOI : 10.1137/08072646X

R. Ennals, Software transactional memory should not be obstruction-free, 2005.

K. Fraser, Practical lock-freedom, 2003.

R. Guerraoui and M. Kapalka, On obstruction-free transactions, Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, SPAA '08, pp.304-313, 2008.
DOI : 10.1145/1378533.1378587

R. Guerraoui and M. Kapalka, The semantics of progress in lock-based transactional memory, POPL, pp.404-415, 2009.

R. Guerraoui and M. Kapalka, Principles of Transactional Memory,Synthesis Lectures on Distributed Computing Theory, 2010.

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

M. 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

M. Herlihy, V. Luchangco, M. Moir, W. N. Scherer, and I. , 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

M. Herlihy and N. Shavit, On the Nature of Progress, OPODIS, pp.313-328, 2011.
DOI : 10.1007/978-3-642-25873-2_22

P. Kuznetsov and S. Ravi, On the Cost of Concurrency in Transactional Memory, OPODIS, pp.112-127, 2011.
DOI : 10.1007/978-3-642-25873-2_9

P. Kuznetsov and S. Ravi, Progressive transactional memory in time and space. CoRR, abs/1502, 13th International Conference on Parallel Computing Technologies, 2015.

P. Kuznetsov and S. Ravi, Why transactional memory should not be obstructionfree

V. J. Marathe, W. N. Iii, and M. L. Scott, Adaptive Software Transactional Memory, Proc. of the 19th International Symposium on Distributed Computing, pp.354-368, 2005.
DOI : 10.1007/11561927_26

P. E. Mckenney, Memory barriers: a hardware view for software hackers, Linux Technology Center, IBM Beaverton, 2010.

D. Perelman, R. Fan, and I. Keidar, On maintaining multiple versions in STM, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.16-25, 2010.
DOI : 10.1145/1835698.1835704

F. Tabba, M. Moir, J. R. Goodman, A. W. Hay, and C. Wang, NZTM, Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, SPAA '09, pp.204-213, 2009.
DOI : 10.1145/1583991.1584048