M. Ansari, Steal-on-abort: Improving transactional memory performance through dynamic transaction reordering, Lecture Notes in Computer Science, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00439445

J. Cachopo and A. Rito-silva, Versioned boxes as the basis for memory transactions, Science of Computer Programming, vol.63, issue.2, pp.172-185, 2006.

L. Dalessandro, M. F. Spear, and M. L. Scott, NOrec: streamlining STM by abolishing ownership records, 2010.

N. Diegues and P. Romano, Time-warp: Lightweight abort minimization in Transactional Memory. Symposium on Principles and Practice of Parallel Programming, 2014.

F. Ellen, P. Fatourou, E. Ruppert, and F. Van-breugel, Non-blocking binary search trees, Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pp.131-140, 2010.

K. Fraser, Practical lock-freedom, 2003.

G. Golan-gueta, G. Ramalingam, M. Sagiv, and E. Yahav, Automatic scalable atomicity via semantic locking, Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp.31-41, 2015.

V. Gramoli, R. Guerraoui, and M. Letia, Composing relaxed transactions, Parallel & Distributed Processing (IPDPS), pp.1171-1182, 2013.

A. Hassan, R. Palmieri, and B. Ravindran, On developing optimistic transactional lazy set, Principles of Distributed Systems, pp.437-452, 2014.

M. Herlihy and E. Koskinen, Transactional boosting: a methodology for highlyconcurrent transactional objects, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, pp.207-216, 2008.

M. Herlihy and N. Shavit, The art of multiprocessor programming, 2011.

E. Koskinen, M. Parkinson, and M. Herlihy, Coarse-grained transactions, ACM Sigplan Notices, vol.45, issue.1, pp.19-30, 2010.

J. Lindén and B. Jonsson, A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention, Principles of Distributed Systems, 2013.

C. H. Papadimitriou, The serializability of concurrent database updates, Journal of the ACM (JACM), vol.26, issue.4, pp.631-653, 1979.

F. Pedone, R. Guerraoui, and A. Schiper, Transaction reordering in replicated databases, Proceedings of the IEEE Symposium on Reliable Distributed Systems pp, pp.175-182, 1997.

A. Spiegelman, G. Golan-gueta, and I. Keidar, Transactional data structure libraries, Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.682-696, 2016.

D. Zhang and D. Dechev, An Efficient Lock-Free Logarithmic Search Data Structure Based on Multi-dimensional List, 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS), pp.281-292, 2016.

D. Zhang and D. Dechev, Lock-free Transactions Without Rollbacks for Linked Data Structures, Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, pp.325-336, 2016.