A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.
Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures , series =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Concurrent Splay-Based Tree
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.