AbstractIt is shown that the average number of rebalancing operations (rotations and double rotations) in weight-balanced trees is constant
An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or e...
Chromatic trees were defined by Nurmi and Soisalon-Soininen, as a new type of binary search tree for...
AbstractThe paper studies balanced trees with variable length records. It generalizes the concept of...
AbstractIt is shown that the average number of rebalancing operations (rotations and double rotation...
It is shown that the average number of rebalancing operations (rotations and double rotations) in we...
Abstract. We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion i...
Since the invention of AVL trees in 1962, many kinds of binary search trees have been proposed. Nota...
AVL trees with relaxed balance were introduced with the aim of improving runtime per formance by all...
We consider binary search trees, where rebalancing transformations need not be connected with update...
B-trees with relaxed balance have been defined to facilitate fast updating on shared-memory asynchro...
AbstractThe idea of relaxed balance is to uncouple the rebalancing in search trees from the updating...
Any B-tree has height at least ceil[log_B(n)]. Static B-trees achieving this height are easy to buil...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a ...
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allo...
AbstractAn amortized analysis of the insertion and deletion algorithms ofk-dimensional balanced bina...
An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or e...
Chromatic trees were defined by Nurmi and Soisalon-Soininen, as a new type of binary search tree for...
AbstractThe paper studies balanced trees with variable length records. It generalizes the concept of...
AbstractIt is shown that the average number of rebalancing operations (rotations and double rotation...
It is shown that the average number of rebalancing operations (rotations and double rotations) in we...
Abstract. We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion i...
Since the invention of AVL trees in 1962, many kinds of binary search trees have been proposed. Nota...
AVL trees with relaxed balance were introduced with the aim of improving runtime per formance by all...
We consider binary search trees, where rebalancing transformations need not be connected with update...
B-trees with relaxed balance have been defined to facilitate fast updating on shared-memory asynchro...
AbstractThe idea of relaxed balance is to uncouple the rebalancing in search trees from the updating...
Any B-tree has height at least ceil[log_B(n)]. Static B-trees achieving this height are easy to buil...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a ...
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allo...
AbstractAn amortized analysis of the insertion and deletion algorithms ofk-dimensional balanced bina...
An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or e...
Chromatic trees were defined by Nurmi and Soisalon-Soininen, as a new type of binary search tree for...
AbstractThe paper studies balanced trees with variable length records. It generalizes the concept of...
DOI
Add to ORKG