1 paper
Vitaly Aksenov, Rene van Bevern, Artem Shilkin
Most work on efficient concurrent ordered indices, such as concurrent binary search trees, B-trees, skip lists, etc., has focused on data structures that provide good \emph{worst-c…