An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or equivalently on the averaged word length of the alphabetical binary code) which is constructed by weight balancing
We revisit multipass pairing heaps and path-balanced binary search trees (BSTs), two classical algor...
AbstractWe characterize AVL trees that have, for their heights and weights, the maximum numbers of n...
Abstract. Problems in circuit fan-out reduction motivate the study of constructing various types of ...
An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or e...
The weighted path length of optimum binary search trees is bounded above by $\sum \beta_i + 2\sum \a...
Binary trees and binary codes have many applications in various branches of science and engineering,...
In this lecture, we will study a technique called weight-balancing, which is very important in de-si...
Problems in circuit fan-out reduction motivate the study of constructing various types of weighted t...
AbstractThe paper studies balanced trees with variable length records. It generalizes the concept of...
AbstractWhile algorithms exist which produce optimal binary trees, there are no direct formulas for ...
AbstractLet Tn denote a binary tree with n terminal nodes V={υ1,…,υn} and let li denote the path len...
AbstractIn this paper, we consider the worst-case time complexity of constructing optimal alphabetic...
AbstractIn a recent paper, D.J. Kleitman and M.E. Saks gave a proof of Huang's conjecture on alphabe...
AbstractIt is shown that the average number of rebalancing operations (rotations and double rotation...
We suggest a new non-recursive algorithm for constructing a binary search tree given an array of num...
We revisit multipass pairing heaps and path-balanced binary search trees (BSTs), two classical algor...
AbstractWe characterize AVL trees that have, for their heights and weights, the maximum numbers of n...
Abstract. Problems in circuit fan-out reduction motivate the study of constructing various types of ...
An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or e...
The weighted path length of optimum binary search trees is bounded above by $\sum \beta_i + 2\sum \a...
Binary trees and binary codes have many applications in various branches of science and engineering,...
In this lecture, we will study a technique called weight-balancing, which is very important in de-si...
Problems in circuit fan-out reduction motivate the study of constructing various types of weighted t...
AbstractThe paper studies balanced trees with variable length records. It generalizes the concept of...
AbstractWhile algorithms exist which produce optimal binary trees, there are no direct formulas for ...
AbstractLet Tn denote a binary tree with n terminal nodes V={υ1,…,υn} and let li denote the path len...
AbstractIn this paper, we consider the worst-case time complexity of constructing optimal alphabetic...
AbstractIn a recent paper, D.J. Kleitman and M.E. Saks gave a proof of Huang's conjecture on alphabe...
AbstractIt is shown that the average number of rebalancing operations (rotations and double rotation...
We suggest a new non-recursive algorithm for constructing a binary search tree given an array of num...
We revisit multipass pairing heaps and path-balanced binary search trees (BSTs), two classical algor...
AbstractWe characterize AVL trees that have, for their heights and weights, the maximum numbers of n...
Abstract. Problems in circuit fan-out reduction motivate the study of constructing various types of ...
DOI
Add to ORKG