In an adaptive bin-deletion game, uniform redistribution and two-choice yield optimal O(n) recourse and O(log log n) load after n/2 rounds, and 2-splitting suffices for linear recourse.
Balanced allocations: the heavily loaded case , year =
2 Pith papers cite this work, alongside 83 external citations. Polarity classification is still indexing.
2
Pith papers citing it
83
external citations · external index
years
2026 2representative citing papers
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.
citing papers explorer
-
Load Balancing under Adaptive Bin Deletions
In an adaptive bin-deletion game, uniform redistribution and two-choice yield optimal O(n) recourse and O(log log n) load after n/2 rounds, and 2-splitting suffices for linear recourse.
-
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.