"A Concurrency-Optimal Binary Search Tree."

Vitaly Aksenov et al. (2017)
a service of Schloss Dagstuhl - Leibniz Center for Informatics