DOI,IST REx ID,Research Group,Title of publication
10.1145/3572848.3577512,12736,"DaAl,GradSch",Unexpected scaling in path copying trees
10.1145/3503221.3508410,11181,DaAl,PathCAS: An efficient middle ground for concurrent search data structures
10.1145/3350755.3400213,8191,DaAl,Memory tagging: Minimalist synchronization for scalable concurrent data structures
null,7272,DaAl,Getting to the root of concurrent binary search tree performance
10.1145/3332466.3374542,7636,DaAl,Non-blocking interpolation search trees with doubly-logarithmic running time
10.1145/3212734.3212756,5963,DaAl,Relaxed schedulers can efficiently parallelize iterative algorithms
10.1145/3178487.3178489,397,DaAl,Harnessing epoch-based reclamation for efficient range queries
10.1145/3210377.3210411,5965,DaAl,Distributionally linearizable data structures
10.1007/978-3-319-96983-1_33,85,DaAl,Snapshot based synchronization: A fast replacement for Hand-over-Hand locking