Abstract: This paper introduces a concurrent data structure called the mound. The mound is a rooted tree of sorted lists that relies on randomization for balance. It supports O(log(log(N))) insert and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results