Self-adjusting binary search trees
Journal of the ACM (JACM)
Multidimensional Height-Balanced Trees
IEEE Transactions on Computers
Efficient Construction of Near-Optimal Binary and Multiway Search Trees
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
CBTree: a practical concurrent self-adjusting search tree
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
We describe a new data structure for maintaining collections of weighted items. The access time for an item of weight w in a collection of total weight W is proportional to log(W/w) in the worst case (which is optimal in a certain sense), and several other useful operations can be made to work just, as fast. The data structure is simpler than previous proposals, but the running time must be amortized over a sequence of operations to achieve the time bounds.