AbstractWe study k-nary balanced trees(B.T.). Under weak conditions for the probability distribution and a realistic measure for the elementary operations for trees we can show that two stage ternary B.T. are better then binary B.T. by approximately the factor log23
AbstractWe study a new family of trees for computation of the Wiener indices. We introduce general t...
La répartition des arbres par catégories de grosseur, en futaie équienne, a été étudiée de façon dét...
This thesis studies the limit distribution of parameters recursively defined on trees (rooted graphs...
AbstractWe study k-nary balanced trees(B.T.). Under weak conditions for the probability distribution...
Abweichender Titel nach Übersetzung der Verfasserin/des VerfassersUnter einem Wurzelbaum versteht ma...
AbstractWe extend the binary search tree model of probability to simply generated families of trees....
We discuss the game-theoretical equilibrium of an AND-OR tree. Here, correlated distributions on the...
AbstractThe class ⊤ of binary search trees is studied. A leaf is a vertex of degree 0; ⊤n is the sub...
We enumerate the strict ordinate binary trees according to two parameters: the direct antecedent of ...
In this paper a simple algorithm to test equality of binary trees currently used in symbolic computa...
An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or e...
AbstractThis paper characterizes binary trees with n leaves, which have the greatest number of subtr...
Es ist weitestgehend bekannt, dass die Bestandesdichte das Wachstum eines Bestandes direkt beeinflus...
The Sacking index of a tree is a measure of balance which has beenintroduced in applications to phyl...
AbstractConcerning the Horton-Strahler number (or register function) of binary trees, Yekutieli and ...
AbstractWe study a new family of trees for computation of the Wiener indices. We introduce general t...
La répartition des arbres par catégories de grosseur, en futaie équienne, a été étudiée de façon dét...
This thesis studies the limit distribution of parameters recursively defined on trees (rooted graphs...
AbstractWe study k-nary balanced trees(B.T.). Under weak conditions for the probability distribution...
Abweichender Titel nach Übersetzung der Verfasserin/des VerfassersUnter einem Wurzelbaum versteht ma...
AbstractWe extend the binary search tree model of probability to simply generated families of trees....
We discuss the game-theoretical equilibrium of an AND-OR tree. Here, correlated distributions on the...
AbstractThe class ⊤ of binary search trees is studied. A leaf is a vertex of degree 0; ⊤n is the sub...
We enumerate the strict ordinate binary trees according to two parameters: the direct antecedent of ...
In this paper a simple algorithm to test equality of binary trees currently used in symbolic computa...
An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or e...
AbstractThis paper characterizes binary trees with n leaves, which have the greatest number of subtr...
Es ist weitestgehend bekannt, dass die Bestandesdichte das Wachstum eines Bestandes direkt beeinflus...
The Sacking index of a tree is a measure of balance which has beenintroduced in applications to phyl...
AbstractConcerning the Horton-Strahler number (or register function) of binary trees, Yekutieli and ...
AbstractWe study a new family of trees for computation of the Wiener indices. We introduce general t...
La répartition des arbres par catégories de grosseur, en futaie équienne, a été étudiée de façon dét...
This thesis studies the limit distribution of parameters recursively defined on trees (rooted graphs...
DOI
Add to ORKG