1. Afek, Y., Kaplan, H., Korenfeld, B., Morrison, A., Tarjan, R. E.: Cbtree: A practical concurrent self-adjusting search tree. In Proceedings of the 26th International Conference on Distributed Computing, DISC’12, pages 1–15, Berlin, Heidelberg. Springer-Verlag (2012)
2. Arbel-Raviv, M., Brown, T., Morrison, A.: Getting to the root of concurrent binary search tree performance. In 2018 USENIX Annual Technical Conference (USENIX ATC 18), pages 295–306, Boston, MA, July 2018. USENIX Association
3. Bagchi, A., Buchsbaum, A.L., Goodrich, M.T.: Biased skip lists. Algorithmica 42(1), 31–48 (2005)
4. Bose, P., Douïeb, K., Langerman, S.: Dynamic optimality for skip lists and b-trees. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1106–1114 (2008)
5. Brown, T.: Techniques for Constructing Efficient Data Structures. PhD thesis, PhD thesis, University of Toronto (2017)