Join-based tree algorithms
In computer science, join-based tree algorithms are a class of algorithms for self-balancing binary search trees. This framework aims at designing highly-parallelized algorithms for various balanced binary search trees.
Source: Wikipedia — Join-based tree algorithms (CC BY-SA 4.0)