Sur le nombre de registres nécessaires à l'évaluation d'une expression arithmétique

Francon, J

doi:10.1051/ita/1984180403551

Cited by 15 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [8], [11], and [18] the average number of registers needed for the evaluation of syntax-trees of different types has been investigated. Furthermore, the minimum recursion-depth required for a certain traversal of a binary tree T is also given by 1 ϩ hs(T) (e.g., see [15]). Meir, Moon, and Pounder [24] investigated the Horton-Strahler number of channel networks with a fixed number of inputs.…”

Section: Introductionmentioning

confidence: 99%

A unified approach to the analysis of Horton‐Strahler parameters of binary tree structures

Nebel

2002

Random Struct Algorithms

View full text Add to dashboard Cite

ABSTRACT:The Horton-Strahler number naturally arose from problems in various fields, e.g., geology, molecular biology and computer science. Consequently, detailed investigations of related parameters for different classes of binary tree structures are of interest. This paper shows one possibility of how to perform a mathematical analysis for parameters related to the Horton-Strahler number in a unified way such that only a single analysis is needed to obtain results for many different classes of trees. The method is explained by the examples of the expected Horton-Strahler number and the related rth moments, the average number of critical nodes, and the expected distance between critical nodes.

show abstract

Section: Introductionmentioning

confidence: 99%

A unified approach to the analysis of Horton‐Strahler parameters of binary tree structures

Nebel

2002

Random Struct Algorithms

View full text Add to dashboard Cite

show abstract

“…Furthermore, the minimum stack-size required for a traversai of a binary tree T is also given by 1 + hs(T) (e.g. see [7] and [11]). Meir et al [18] investigated the Horton-Strahler number of channel networks with a fixed number of inputs.…”

Section: Introductionmentioning

confidence: 99%

On the Horton-Strahler Number for Combinatorial Tries

Nebel

2000

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

“…Furthermore, the minimum number of registers required to evaluate an expression tree with root u is exactly S u + 1. As expression évaluation is a special type of postorder traversai, the same paradigm shows that the minimum stack size required for a postorder traversai of a binary tree is S u + 1 (e.g., see Françon [8]). In fact, the Horton-Strahler number occurs in almost every field involving some kind of natural branching pattern.…”

Section: Introductionmentioning

confidence: 99%