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 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing , series =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Fractional Verkle Trees decompose global state into N sub-accumulators with a coordinating Merkle tree, yielding faster root recomputation, lower memory use, and parallel insertion in blockchain state accumulators.
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.