Relaxed multi-way trees with group updates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Search Trees with Relaxed Balance and Near-Optimal Height
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Complexity of Layered Binary Search Trees with Relaxed Balance
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Exponentially Decreasing Number of Operations in Balanced Trees
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
The Performance of Concurrent Red-Black Tree Algorithms
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Group Updates for Red-Black Trees
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Relaxed multi-way trees with group updates
Journal of Computer and System Sciences - Special issu on PODS 2001
Deleting keys of B-trees in parallel
Journal of Parallel and Distributed Computing
Non-blocking binary search trees
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A contention-friendly binary search tree
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
A general technique for non-blocking trees
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
| Hi-index | 0.00 |