A. Umut, G. E. Acar, and . Blelloch, Algorithm Design: Theory and Practice, vol.20, p.49, 2017.

A. Umut, A. Acar, M. Charguéraud, and . Rainey, Scheduling parallel programs by work stealing with private deques, ACM SIGPLAN Notices, vol.48, p.68, 2013.

A. Umut, A. Acar, M. Charguéraud, and . Rainey, A work-efficient algorithm for parallel unordered depth-first search, High Performance Computing, Networking, Storage and Analysis, 2015 SC-International Conference for, p.64, 2015.

A. Umut, A. Acar, M. Charguéraud, and . Rainey, Oracle-guided scheduling for controlling granularity in implicitly parallel languages, Journal of Functional Programming, vol.26, p.38, 2016.

V. Umut-a-acar, S. Aksenov, and . Westrick, Brief announcement: Parallel dynamic tree contraction via self-adjusting computation, Proceedings of the twentyninth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), vol.16, p.138, 2017.

V. Umut-a-acar, S. Aksenov, and . Westrick, Brief-announsement: Parallel dynamic tree contraction via self-adjusting computation, Proceedings of the twentyninth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp.275-277, 2017.

V. Umut-a-acar, A. Aksenov, M. Charguéraud, and . Rainey, Performance challenges in modular parallel programs, Proceedings of the twenty third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp.381-382, 2018.

G. Adelson, -. Velsky, and E. Landis, An algorithm for the organization of information, vol.145, p.99, 1962.

V. Sarita, K. Adve, and . Gharachorloo, Shared memory consistency models: A tutorial, computer, vol.29, issue.12, p.19, 1996.

Y. Afek, E. Weisberger, and H. Weisman, A completeness theorem for a class of synchronization objects, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, p.129, 1993.

Y. Afek, E. Gafni, and A. Morrison, Common2 extended to stacks and unbounded concurrency, Distributed Computing, vol.20, issue.4, p.139, 2007.
DOI : 10.1145/1146381.1146415

K. Agrawal, J. T. Fineman, K. Lu, B. Sheridan, J. Sukha et al., Provably good scheduling for parallel programs that use data structures through implicit batching, Proceedings of the twenty-sixth annual ACM symposium on Parallelism in algorithms and architectures, vol.115, p.116, 1995.
DOI : 10.1145/2692916.2555284

V. Aksenov, P. Kuznetsov, and A. Shalyto, On helping and stacks, Proceedings of NETYS 2018

V. Aksenov, V. Gramoli, P. Kuznetsov, A. Malova, and S. Ravi, A concurrency-optimal binary search tree, European Conference on Parallel Processing, pp.580-593, 2017.
DOI : 10.1007/978-3-319-64203-1_42
URL : https://hal.archives-ouvertes.fr/hal-01664898

V. Aksenov, D. Alistarh, and P. Kuznetsov, Brief-announcement: Performance prediction of coarse-grained programs, Proceedings of the thirty seventh annual ACM Symposium on Principles of distributed computing (PODC), pp.411-413, 2018.

V. Aksenov, P. Kuznetsov, and A. Shalyto, Parallel combining: Benefits of explicit synchronization, 2018.

Y. James-h-anderson, T. Kim, and . Herman, Shared-memory mutual exclusion: major research trends since 1986, vol.16, p.25, 2003.

M. Arbel, -. , and T. Brown, Reuse, don't recycle: Transforming lockfree algorithms that throw away descriptors, 31 International Symposium on Distributed Computing, vol.91, p.129, 2017.

S. Nimar, R. D. Arora, C. Blumofe, and . Plaxton, Thread scheduling for multiprogrammed multiprocessors. Theory of Computing Systems, vol.34, pp.115-144, 1921.

J. Aspnes, M. Herlihy, and N. Shavit, Counting networks, Journal of the ACM (JACM), vol.41, issue.5, pp.1020-1048, 1994.

H. Attiya and J. Welch, Distributed computing: fundamentals, simulations, and advanced topics, vol.19, p.73, 2004.

H. Attiya, A. Castañeda, and D. Hendler, Nontrivial and universal helping for wait-free queues and stacks, LIPIcs-Leibniz International Proceedings in Informatics, vol.46, p.139, 2016.

G. Barnes, A method for implementing lock-free shared-data structures, Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures, p.28, 1993.

L. Bergstrom, M. Rainey, J. Reppy, A. Shaw, and M. Fluet, Lazy tree splitting, ACM Sigplan Notices, vol.45, p.72, 2010.

E. Guy and . Blelloch, Scans as primitive parallel operations, IEEE Transactions on computers, vol.38, issue.11, p.19, 1989.

E. Guy and . Blelloch, Nesl: A nested data-parallel language, vol.21, p.37, 1991.

E. Guy and . Blelloch, Programming parallel algorithms, Communications of the ACM, vol.39, issue.3, pp.85-97, 1921.

E. Guy, M. Blelloch, and . Reid-miller, Fast set operations using treaps, Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.28, 1998.

E. Guy, . Blelloch, L. Gary, J. C. Miller, D. Hardwick et al., Design and implementation of a practical parallel delaunay algorithm, Algorithmica, vol.24, issue.3-4, p.64, 1999.

J. T. Guy-e-blelloch, P. B. Fineman, J. Gibbons, and . Shun, Internally deterministic parallel algorithms can be fast, ACM SIGPLAN Notices, vol.47, p.137, 2012.

E. Guy, D. Blelloch, Y. Ferizovic, and . Sun, Just join for parallel ordered sets, Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, vol.114, p.139, 1999.

D. Robert, C. E. Blumofe, and . Leiserson, Scheduling multithreaded computations by work stealing, Journal of the ACM (JACM), vol.46, issue.5, p.21, 1999.

, OpenMP Architecture Review Board. Openmp application interface, vol.12, p.37, 2008.

L. Bougé, J. Gabarro, X. Messeguer, and N. Schabanel, Heightrelaxed avl rebalancing: A unified, fine-grained approach to concurrent dictionaries, p.28, 1998.

A. Braginsky, N. Cohen, and E. Petrank, Cbpq: High performance lock-free priority queue, European Conference on Parallel Processing, vol.36, p.114, 2016.

P. Richard and . Brent, The parallel evaluation of general arithmetic expressions, Journal of the ACM (JACM), vol.21, issue.2, p.21, 1974.

J. Gerth-stølting-brodal, C. D. Larsson-träff, and . Zaroliagis, A parallel priority queue with constant time operations, Journal of Parallel and Distributed Computing, vol.49, issue.1, p.98, 1998.

J. Nathan-g-bronson, H. Casper, K. Chafi, and . Olukotun, A practical concurrent binary search tree, ACM Sigplan Notices, vol.45, p.113, 2010.

T. Brown, F. Ellen, and E. Ruppert, Pragmatic primitives for non-blocking data structures, Proceedings of the 2013 ACM symposium on Principles of distributed computing, p.30, 2013.

T. Brown, F. Ellen, and E. Ruppert, A general technique for non-blocking trees, ACM SIGPLAN Notices, vol.49, p.30, 2014.

Z. Budimli?, V. Cavé, R. Raman, J. Shirako, S. Ta??rlar et al., The design and implementation of the habanerojava parallel programming language, Proceedings of the ACM International Conference Companion on Object Oriented Programming Systems Languages and Applications, vol.21, p.37, 2011.

I. Calciu, H. Mendes, and M. Herlihy, The adaptive priority queue with elimination and combining, International Symposium on Distributed Computing, p.36, 2014.

K. Censor-hillel, E. Petrank, and S. Timnat, Help! In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, vol.13, p.130, 2015.

D. Chakrabarti, Y. Zhan, and C. Faloutsos, R-mat: A recursive model for graph mining, Proceedings of the 2004 SIAM International Conference on Data Mining, p.64, 2004.

M. T. Manuel, R. Chakravarty, S. P. Leshchinskiy, G. Jones, S. Keller et al., Data parallel haskell: a status report, Proceedings of the 2007 workshop on Declarative aspects of multicore programming, p.37, 2007.

P. Charles, C. Grothoff, V. Saraswat, C. Donawa, and A. Kielstra, Kemal Ebcioglu, Christoph Von Praun, and Vivek Sarkar. X10: an objectoriented approach to non-uniform cluster computing, vol.40, p.37, 2005.

K. Vinay, V. Chaudhri, and . Hadzilacos, Safe locking policies for dynamic databases, Journal of Computer and System Sciences, vol.57, issue.3, p.74, 1998.

R. Cole, Parallel merge sort, SIAM Journal on Computing, vol.17, issue.4, p.33, 1988.

C. E. Thomas-h-cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to algorithms, vol.12, p.33, 2009.

T. Craig, Building fifo and priorityqueuing spin locks from atomic swap, vol.13, p.132, 1993.

T. Crain, V. Gramoli, and M. Raynal, A contention-friendly binary search tree, European Conference on Parallel Processing, vol.95, p.113, 1991.

T. David, R. Guerraoui, and V. Trigonakis, Everything you always wanted to know about synchronization but were afraid to ask, Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, vol.132, p.135, 2013.

A. Timothy, Y. Davis, and . Hu, The university of florida sparse matrix collection, ACM Transactions on Mathematical Software (TOMS), vol.38, issue.1, p.65, 2011.

. Sk-debray, V. Manuel, P. L. Hermenegildo, and . García, A methodology for granularity-based control of parallelism in logic programs, Journal of symbolic computation, vol.21, issue.4-6, p.69, 1996.

N. Deo and S. Prasad, Parallel heap: An optimal parallel priority queue, The Journal of Supercomputing, vol.6, issue.1, p.104, 1992.

D. Drachsler, M. Vechev, and E. Yahav, Practical concurrent binary search trees via logical ordering, ACM SIGPLAN Notices, vol.49, issue.8, p.113, 1991.

D. Drachsler-cohen and E. Petrank, Lcd: Local combining on demand, International Conference On Principles Of Distributed Systems, vol.16, p.115, 2014.
DOI : 10.1007/978-3-319-14472-6_24

N. James-r-driscoll, . Sarnak, D. Daniel, R. E. Sleator, and . Tarjan, Making data structures persistent, Journal of computer and system sciences, vol.38, issue.1, p.139, 1989.

A. Duran, J. Corbalán, and E. Ayguadé, An adaptive cut-off for task parallelism, International Conference on High Performance Computing, Networking, Storage and Analysis (SC)), p.69, 2008.
DOI : 10.1109/sc.2008.5213927

D. Eisenstat, Two-enqueuer queue in common2, p.117, 2008.

F. Ellen, P. Fatourou, E. Ruppert, and F. Van-breugel, Nonblocking binary search trees, Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, vol.81, p.91, 2010.

L. Fajstrup, E. Goubault, E. Haucourt, S. Mimram, and M. Raussen, Directed algebraic topology and concurrency, p.138, 2016.
DOI : 10.1007/978-3-319-15398-8

P. Fatourou, . Nikolaos, and . Kallimanis, A highly-efficient wait-free universal construction, Proceedings of the twenty-third annual ACM Symposium on Parallelism in Algorithms and Architectures, vol.115, p.129, 2011.
DOI : 10.1145/1989493.1989549

P. Fatourou, . Nikolaos, and . Kallimanis, Revisiting the combining synchronization technique, ACM SIGPLAN Notices, vol.47, p.115, 2012.
DOI : 10.1145/2370036.2145849

M. Feeley, A message passing implementation of lazy task creation, US/Japan Workshop on Parallel Symbolic Computing, vol.38, p.72, 1992.

M. Feeley, Polling efficiently on stock hardware, Proceedings of the conference on Functional programming languages and computer architecture, pp.179-187
DOI : 10.1145/165180.165205

S. Feldman, P. Laborde, and D. Dechev, A wait-free multi-word compare-and-swap operation, International Journal of Parallel Programming, vol.43, issue.4, p.129, 2015.
DOI : 10.1007/s10766-014-0308-7

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, p.32, 2004.
DOI : 10.1145/1011767.1011776

J. Fork-join, , p.37

S. Fortune and J. Wyllie, Parallelism in random access machines, Proceedings of the tenth annual ACM symposium on Theory of computing, pp.114-118, 1978.
DOI : 10.1145/800133.804339

M. Frigo, K. Charles-e-leiserson, and . Randall, The implementation of the cilk-5 multithreaded language, ACM Sigplan Notices, vol.33, issue.5, p.68, 1998.

B. Phillip and . Gibbons, A more practical pram model, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.20, 1989.

Y. Phillip-b-gibbons, V. Matias, and . Ramachandran, The queue-read queuewrite pram model: Accounting for contention in parallel algorithms, SIAM Journal on Computing, p.19, 1997.

H. Gaston, J. Gonnet, and . Munro, Heaps on heaps, SIAM Journal on Computing, vol.15, issue.4, p.104, 1986.

V. Gramoli, More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms, ACM SIGPLAN Notices, vol.50, p.91, 2015.

V. Gramoli, P. Kuznetsov, S. Ravi, and D. Shang, Brief announcement: a concurrency-optimal list-based set, International Symposium on Distributed Computing, vol.93, p.138, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01207872

V. Gramoli, P. Kuznetsov, and S. Ravi, From sequential to concurrent: correctness and relative efficiency (brief announcement), Principles of Distributed Computing (PODC), p.93, 2012.

V. Gramoli, P. Kuznetsov, and S. Ravi, In the search for optimal concurrency, Structural Information and Communication Complexity-23rd International Colloquium, SIROCCO, vol.15, p.93, 2016.
DOI : 10.1007/978-3-319-48314-6_10
URL : http://arxiv.org/pdf/1603.01384

R. Guerraoui, A. Thomas, V. Henzinger, and . Singh, Permissiveness in transactional memories, International Symposium on Distributed Computing, p.74, 2008.
DOI : 10.1007/978-3-540-87779-0_21
URL : https://infoscience.epfl.ch/record/125702/files/main.pdf

J. Leo, R. Guibas, and . Sedgewick, A dichromatic framework for balanced trees, Foundations of Computer Science, 1978., 19th Annual Symposium on, vol.27, p.99, 1978.

R. Gupta and C. Hill, A scalable implementation of barrier synchronization using an adaptive combining tree, International Journal of Parallel Programming, vol.18, issue.3, p.115, 1989.

H. Robert and . Halstead, Implementation of multilisp: Lisp on a multiprocessor, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.68, 1984.

L. Timothy and . Harris, A pragmatic implementation of non-blocking linked-lists, International Symposium on Distributed Computing, vol.16, p.95, 2001.

S. Heller, M. Herlihy, V. Luchangco, M. Moir, N. William et al., A lazy concurrent list-based set algorithm, International Conference On Principles Of Distributed Systems, vol.16, p.95, 2005.
DOI : 10.1007/11795490_3
URL : http://www.cs.rochester.edu/~scherer/papers/2005-OPODIS-Lazy.pdf

D. Hendler, I. Incze, N. Shavit, and M. Tzafrir, Flat combining and the synchronization-parallelism tradeoff, Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures, vol.16, p.115, 2010.
DOI : 10.1145/1810479.1810540
URL : http://www.cs.bgu.ac.il/%7Ehendlerd/papers/flat-combining.pdf

D. Hendler, I. Incze, N. Shavit, and M. Tzafrir, Scalable flat-combining based synchronous queues, DISC, p.115, 2010.
DOI : 10.1007/978-3-642-15763-9_8
URL : http://www.cs.bgu.ac.il/%7Ehendlerd/papers/FC-synch-queue-main.pdf

M. Herlihy, N. Lev, and . Shavit, A lock-free concurrent skiplist with wait-free search. Unpublished Manuscript, vol.32, p.35, 2007.

M. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.13, issue.1, p.117, 1991.

M. Herlihy and N. Shavit, The art of multiprocessor programming, vol.17, p.114, 2011.
DOI : 10.1145/1146381.1146382

M. Herlihy and N. Shavit, On the nature of progress, International Conference On Principles Of Distributed Systems, vol.12, p.74, 2011.

M. Herlihy, Y. Lev, V. Luchangco, and N. Shavit, A simple optimistic skiplist algorithm, International Colloquium on Structural Information and Communication Complexity, vol.32, p.35, 2007.
DOI : 10.1007/978-3-540-72951-8_11

P. Maurice, J. M. Herlihy, and . Wing, Linearizability: A correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.12, issue.3, p.73, 1990.

T. Hiraishi, M. Yasugi, S. Umatani, and T. Yuasa, Backtrackingbased load balancing, ACM Sigplan Notices, vol.44, p.68, 2009.

J. Holm, K. D. Lichtenberg, and M. Thorup, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, Journal of the ACM (JACM), vol.48, issue.4, p.112, 2001.
DOI : 10.1145/276698.276715

B. Holt, J. Nelson, B. Myers, P. Briggs, L. Ceze et al., Flat combining synchronized global data structures, 7th International Conference on PGAS Programming Models, p.115, 2013.

V. Shane, J. Howley, and . Jones, A non-blocking internal binary search tree, Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures, vol.16, p.129, 2012.

L. Huelsbergen, A. James-r-larus, and . Aiken, Using the run-time sizes of data structures to guide parallel-thread creation, In ACM SIGPLAN Lisp Pointers, vol.7, p.69, 1994.

C. Galen, . Hunt, M. Maged, S. Michael, M. Parthasarathy et al., An efficient algorithm for concurrent priority queue heaps, Information Processing Letters, vol.60, issue.3, p.34, 1996.

. Intel, Intel threading building blocks, vol.38, p.40, 2011.

. Intel, Intel cilk plus manual, vol.37, p.39, 2017.

S. Iwasaki and K. Taura, A static cut-off for task parallel programs, International Conference on Parallel Architecture and Compilation Techniques (PACT), p.72, 2016.

A. Suresh-jagannathan, . Navabi, L. Kc-sivaramakrishnan, and . Ziarek, The design rationale for multi-mlton, ML'10: Proceedings of the ACM SIGPLAN Workshop on ML, p.37, 2010.

J. Jájá, An introduction to parallel algorithms, vol.17, p.131, 1992.

. John-r-koza, Genetic programming as a means for programming computers by natural selection, Statistics and computing, vol.4, issue.2, p.137, 1994.

. Clyde, Searching, merging, and sorting in parallel computation, IEEE Transactions on Computers, issue.10, p.33, 1983.

V. Kumar, D. Frampton, M. Stephen, D. Blackburn, O. Grove et al., Work-stealing without the baggage, ACM SIGPLAN Notices, vol.47, p.68, 2012.

P. Kuznetsov and S. Ravi, On the cost of concurrency in transactional memory, International Conference On Principles Of Distributed Systems, p.74, 2011.

H. Kwak, C. Lee, H. Park, and S. Moon, What is twitter, Proceedings of the 19th international conference on World wide web, p.65, 2010.

. Charles-e-leiserson and . Ilya-b-mirman, How to survive the multicore software revolution (or at least survive the hype), Cilk Arts, vol.1, p.11, 2008.

Z. Li, Non-blocking implementations of queues in asynchronous distributed shared-memory systems, p.117, 2001.

, Task Parallel Library, vol.21, p.37

J. Lindén and B. Jonsson, A skiplist-based concurrent priority queue with minimal memory contention, International Conference On Principles Of Distributed Systems, vol.17, p.114, 2013.

Y. Liu and M. Spear, Mounds: Array-based concurrent priority queues, 41st International Conference on Parallel Processing, p.36, 2012.

. Michael-d-mccool, J. Arch-d-robison, and . Reinders, Structured parallel programming: patterns for efficient computation, vol.14, p.138, 2012.

M. John-m-mellor-crummey and . Scott, Algorithms for scalable synchronization on shared-memory multiprocessors, ACM Transactions on Computer Systems (TOCS), vol.9, issue.1, p.132, 1991.

M. Maged and . Michael, High performance dynamic lock-free hash tables and list-based sets, Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, p.129, 2002.

E. Mohr, A. David, R. Kranz, and . Halstead, Lazy task creation: A technique for increasing the granularity of parallel programs, IEEE transactions on Parallel and Distributed Systems, vol.2, issue.3, p.72, 1991.

. Gordon-e-moore, Cramming more components onto integrated circuits. Electronic Magazine, p.11, 1965.

A. Natarajan and N. Mittal, Fast concurrent lock-free binary search trees, ACM SIGPLAN Notices, vol.49, p.138, 1991.
DOI : 10.1145/2555243.2555256

A. Natarajan, H. Lee, N. Savoie, and . Mittal, Concurrent wait-free red black trees, Symposium on Self-Stabilizing Systems, vol.16, p.29, 2013.
DOI : 10.1007/978-3-319-03089-0_4

G. Neiger, Set-linearizability, Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, p.396, 1994.
DOI : 10.1145/197917.198176

J. Nievergelt and . Edward-m-reingold, Binary search trees of bounded balance, SIAM journal on Computing, vol.2, issue.1, p.99, 1973.

, The nineth dimacs implementation challenge, p.65, 2013.

O. Nurmi and E. Soisalon-soininen, Chromatic binary search trees. Acta informatica, vol.33, p.30, 1996.
DOI : 10.1007/bf03036462

Y. Oyama, K. Taura, and A. Yonezawa, Executing parallel programs with synchronization bottlenecks efficiently, Proceedings of the International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications, vol.16, p.115, 1999.

H. Christos and . Papadimitriou, The serializability of concurrent database updates, Journal of the ACM (JACM), vol.26, issue.4, p.73, 1979.

S. Mark, J. Papamarcos, and . Patel, A low-overhead coherence solution for multiprocessors with private cache memories, In ACM SIGARCH Computer Architecture News, vol.12, p.132, 1984.

W. Paul, U. Vishkin, and H. Wagener, Parallel dictionaries on 2-3 trees, International Colloquium on Automata, Languages, and Programming, p.16, 1983.

D. Joseph, J. Pehoushek, and . Weening, Low-cost process creation and dynamic partitioning in qlisp, US/Japan Workshop on Parallel Lisp, vol.38, p.68, 1989.

Y. Peng and Z. Hao, Fa-stack: A fast array-based stack with wait-free progress guarantee, vol.117, p.129, 2017.

M. , C. Pinotti, and G. Pucci, Parallel priority queues, Information Processing Letters, vol.40, issue.1, p.104, 1991.

H. Plummer, On the problem of distribution in globular star clusters. Monthly notices of the royal astronomical society, vol.71, p.64, 1911.

W. Pugh, Concurrent maintenance of skip lists, vol.31, p.35, 1990.

W. Pugh, Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, vol.33, issue.6, p.30, 1990.

D. Sanchez, M. Richard, C. Yoo, and . Kozyrakis, Flexible architectural support for fine-grain scheduling, ACM Sigplan Notices, vol.45, p.68, 2010.

P. Sanders, Randomized priority queues for fast parallel access, Journal of Parallel and Distributed Computing, vol.49, issue.1, p.104, 1998.
DOI : 10.1006/jpdc.1998.1429
URL : https://publikationen.bibliothek.kit.edu/4397/1801

R. Seidel and C. R. Aragon, Randomized search trees, Algorithmica, vol.16, issue.4-5, p.99, 1996.

N. Shavit and I. Lotan, Skiplist-based concurrent priority queues, Proceeding of 14th International Parallel and Distributed Processing Symposium, vol.17, p.114, 2000.
DOI : 10.1109/ipdps.2000.845994
URL : http://ai.stanford.edu/~itayl/ipdps.pdf

N. Shavit and A. Zemach, Diffracting trees, ACM Transactions on Computer Systems (TOCS), vol.14, issue.4, p.115, 1996.
DOI : 10.1145/235543.235546

N. Shavit and A. Zemach, Combining funnels: a dynamic approach to software combining, Journal of Parallel and Distributed Computing, vol.60, issue.11, p.115, 2000.

J. Shun, E. Guy, J. T. Blelloch, P. B. Fineman, A. Gibbons et al., Brief announcement: the problem based benchmark suite, Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures, vol.64, p.137, 2012.

B. Stroustrup, The c++ programming language, p.39, 2013.

H. Sundell and P. Tsigas, Scalable and lock-free concurrent dictionaries, Proceedings of the 2004 ACM symposium on Applied computing, vol.31, p.35, 2004.

H. Sundell and P. Tsigas, Fast and lock-free concurrent priority queues for multi-thread systems, Journal of Parallel and Distributed Computing, vol.65, issue.5, p.35, 2005.

H. Sutter, The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's journal, vol.30, p.11, 2005.

H. Sutter, Choose concurrency-friendly data structures, 1974.

O. Tardieu, H. Wang, and H. Lin, A work-stealing scheduler for x10's task parallelism with suspension, ACM SIGPLAN Notices, vol.47, issue.8, p.68, 2012.

. Robert-e-tarjan, Efficient top-down updating of red-black trees, p.29, 1985.

P. Thoman, H. Jordan, and T. Fahringer, Adaptive granularity control in task parallel programs using multiversioning, European Conference on Parallel Processing, p.69, 2013.

S. Timnat, A. Braginsky, A. Kogan, and E. Petrank, Wait-free linked-lists, International Conference On Principles Of Distributed Systems, vol.117, p.129, 2012.
DOI : 10.1145/2370036.2145869

J. Tsay and H. Li, Lock-free concurrent tree structures for multiprocessor systems, International Conference on Parallel and Distributed Systems, p.29, 1994.

A. Tzannes, C. George, R. Caragea, U. Barua, and . Vishkin, Lazy binary-splitting: a run-time adaptive work-stealing scheduler, ACM Sigplan Notices, vol.45, issue.5, p.72, 2010.

G. Leslie and . Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, p.19, 1990.

. Joseph-s-weening, Parallel execution of lisp programs, vol.38, p.72, 1989.

Y. Pen-chung and T. Nian-feng, Distributing hot-spot addressing in large-scale multiprocessors, IEEE Transactions on Computers, vol.100, issue.4, p.115, 1987.