• Kobus T, Kokociński M and Wojciechowski P. Jiffy. Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. (400-415).

    https://doi.org/10.1145/3503221.3508437

  • Winblad K, Sagonas K and Jonsson B. (2021). Lock-free Contention Adapting Search Trees. ACM Transactions on Parallel Computing. 8:2. (1-38). Online publication date: 30-Jun-2021.

    https://doi.org/10.1145/3460874

  • Singh A, Brown T and Mashtizadeh A. NBR. Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. (175-190).

    https://doi.org/10.1145/3437801.3441625

  • Natarajan A, Ramachandran A and Mittal N. (2020). FEAST. ACM Transactions on Parallel Computing. 7:2. (1-64). Online publication date: 31-May-2020.

    https://doi.org/10.1145/3391438

  • Fatourou P, Papavasileiou E and Ruppert E. Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. The 31st ACM Symposium on Parallelism in Algorithms and Architectures. (275-286).

    https://doi.org/10.1145/3323165.3323197

  • Winblad K, Sagonas K and Jonsson B. Lock-free Contention Adapting Search Trees. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. (121-132).

    https://doi.org/10.1145/3210377.3210413

  • Prokopec A. (2018). Cache-tries. ACM SIGPLAN Notices. 53:1. (137-151). Online publication date: 23-Mar-2018.

    https://doi.org/10.1145/3200691.3178498

  • Prokopec A. Cache-tries. Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. (137-151).

    https://doi.org/10.1145/3178487.3178498

  • Brown T. Reclaiming Memory for Lock-Free Data Structures. Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. (261-270).

    https://doi.org/10.1145/2767386.2767436

  • Liu Y, Zhou T and Spear M. Transactional Acceleration of Concurrent Data Structures. Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures. (244-253).

    https://doi.org/10.1145/2755573.2755598

  • Brown T, Ellen F and Ruppert E. (2014). A general technique for non-blocking trees. ACM SIGPLAN Notices. 49:8. (329-342). Online publication date: 26-Nov-2014.

    https://doi.org/10.1145/2692916.2555267

  • Natarajan A and Mittal N. (2014). Fast concurrent lock-free binary search trees. ACM SIGPLAN Notices. 49:8. (317-328). Online publication date: 26-Nov-2014.

    https://doi.org/10.1145/2692916.2555256

  • Ellen F, Fatourou P, Helga J and Ruppert E. The amortized complexity of non-blocking binary search trees. Proceedings of the 2014 ACM symposium on Principles of distributed computing. (332-340).

    https://doi.org/10.1145/2611462.2611486

  • Brown T, Ellen F and Ruppert E. A general technique for non-blocking trees. Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming. (329-342).

    https://doi.org/10.1145/2555243.2555267

  • Natarajan A and Mittal N. Fast concurrent lock-free binary search trees. Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming. (317-328).

    https://doi.org/10.1145/2555243.2555256

  • Brown T, Ellen F and Ruppert E. Pragmatic primitives for non-blocking data structures. Proceedings of the 2013 ACM symposium on Principles of distributed computing. (13-22).

    https://doi.org/10.1145/2484239.2484273