Monosubstituted alkanes as stereoisomers, not as constitutional isomers, are regarded as planted threedimensional (3D) trees, which are defined as a 3D extension of planted trees (graphs). They are thus recognized as 3D-objects (planted promolecules) and enumerated by Fujita’s proligand method (Fujita S (2005) Theor. Chem. Acc. 113:73–79, 113:80–86, Fujita S (2006) Theor. Chem. Acc. 115:37–53)....

We present an incremental evaluation algorithm for materialized views in relational and deductive database systems. The algorithm computes, in an incremental fashion, the changes to the materialized view in response to changes (insertions, deletions, and updates) to the base relations. The view may be deened in SQL or in Datalog, and may use UNION , negation, aggregation (e.g. SUM, MIN), linear...

In this extended abstract, we outline how to derive limit theorems for the number of subtrees of size k on the fringe of random plane-oriented recursive trees. Our proofs are based on the method of moments, where a complex-analytic approach is used for constant k and an elementary approach for k which varies with n. Our approach is of some generality and can be applied to other simple classes o...

The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the variances, and limit laws for this parameter. The limit distributions are characterized as the projections of bivariate measures that satisfy certain fixed-point equations. Covariances, asymptotic correlations, and bivariate ...

We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depending on the size of the subtree. We introduce a new approach to this problem which helps us to further clarify this phenomenon. More precisely, we derive optimal Berry-Esseen bounds and local limit theorems for the norm...

The average height of a binary tree with n internal nodes is shown to be asymptotic to 2 6. This represents the average stack height of the simplest recursive tree traversal algorithm. The method used in this estimation is also applicable to the analysis of traversal algorithms of unary-binary trees, unbalanced 2-3 trees, t-ary trees for any t, and other families of trees. It yields the two pre...

A new scalable scheduling strategy using cut through switching is proposed in this paper. Recursive and closed form expressions for speedup are found in heterogeneous single level trees and in homogeneous multilevel trees, respectively. The ratio of speedup using cut through switching to that using store and forward switching is presented so as to illustrate the amount of improvement in speedup...

A nonparametric regression method that blends key features of piecewise polynomial quantile regression and tree-structured regression based on adaptive recursive partitioning of the covariate space is investigated. Unlike least squares regression trees, which concentrate on modeling the relationship between the response and the covariates at the center of the response distribution, our quantile...

Combinatorial objects such as rooted trees that carry a recursive structure have found important applications recently in both mathematics and physics. We put such structures in an algebraic framework of operated semigroups. This framework provides the concept of operated semigroups with intuitive and convenient combinatorial descriptions, and at the same time endows the familiar combinatorial ...