L. Ballard, Conflict avoidance: Data structures in transactional memory, 2006.

S. Borkar, Thousand core chips, Proceedings of the 44th annual conference on Design automation, DAC '07, pp.746-749, 2007.
DOI : 10.1145/1278480.1278667

L. Bougé, J. Gabarro, X. Messeguer, and N. Schabanel, Height-relaxed AVL rebalancing: A unified, fine-grained approach to concurrent dictionaries, 1998.

N. G. Bronson, J. Casper, H. Chafi, and K. Olukotun, A practical concurrent binary search tree, Proc. of the 15th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, 2010.

T. Crain, V. Gramoli, and M. , A speculation-friendly binary search tree, Proc. of the 17th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00618995

D. Dice, O. Shalev, and N. Shavit, Transactional Locking II, Proc. of the 20th Int'l Symp. on Distributed Computing, 2006.
DOI : 10.1007/11864219_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.811

C. Dwork, M. Herlihy, and O. Waarts, Contention in shared memory algorithms, Journal of the ACM, vol.44, issue.6, pp.779-805, 1997.
DOI : 10.1145/268999.269000

F. Ellen, P. Fatourou, E. Ruppert, and F. Van-breugel, Non-blocking binary search trees, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.131-140, 2010.
DOI : 10.1145/1835698.1835736

P. Felber, V. Gramoli, and R. Guerraoui, Elastic transactions, Proc. of the 23rd Int'l Symp. on Distributed Computing, 2009.

M. Fomitchev and E. Ruppert, Lock-free linked lists and skip lists, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.50-59, 2004.
DOI : 10.1145/1011767.1011776

K. Fraser, Practical lock freedom, 2003.

M. Frigo, C. Leiserson, H. Prokop, and S. Ramachandran, Cache-oblivious algorithms, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp.285-297, 1999.

L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), 1978.
DOI : 10.1109/SFCS.1978.3

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

M. Herlihy, E. Koskinen, M. Herlihy, Y. Lev, V. Luchangco et al., Transactional boosting, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.124-138, 2007.
DOI : 10.1145/1345206.1345237

M. Herlihy and N. Shavit, The art of multiprocessor programming, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, 2008.
DOI : 10.1145/1146381.1146382

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

J. L. Kessels, On-the-fly optimization of data structures, Communications of the ACM, vol.26, issue.11, pp.895-901, 1983.
DOI : 10.1145/182.358442

G. Korland, N. Shavit, and P. Felber, Deuce: Noninvasive software transactional memory, Transactions on HiPEAC, vol.5, issue.2, p.2010

U. Manbar and R. E. Ladner, Concurrency control in a dynamic search structure, ACM Transactions on Database Systems, vol.9, issue.3, pp.439-455, 1984.
DOI : 10.1145/1270.318576

T. G. Mattson, M. Riepen, T. Lehnig, P. Brett, W. Haas et al., The 48-core SCC Processor: the Programmer's View, 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, pp.1-11, 2010.
DOI : 10.1109/SC.2010.53

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