scientific article; zbMATH DE number 3390782
From MaRDI portal
Publication:5659554
zbMath0247.05106MaRDI QIDQ5659554
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Asymptotic results on arithmetic functions (11N37) Information theory (general) (94A15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (82)
On growing random binary trees ⋮ Protection number in plane trees ⋮ Batcher's odd-even exchange revisited: a generating functions approach ⋮ The height of multiple edge plane trees ⋮ Watermelon uniform random generation with applications ⋮ A bijection between directed column-convex polyominoes and ordered trees of height at most three ⋮ A new interpretation of the Catalan numbers arising in the theory of crystals ⋮ On weighted heights of random trees ⋮ Simulating theta random variates ⋮ Patterns in Shi tableaux and Dyck paths ⋮ On the average hyperoscillations of planted plane trees ⋮ Some combinatorial matrices and their LU-decomposition ⋮ Retakh's Motzkin paths and some combinatorial comments ⋮ Fringe analysis of plane trees related to cutting and pruning ⋮ Solution of a problem of yekutieli and mandelbrot ⋮ The height of two types of generalised Motzkin paths ⋮ Bounded capacity priority queues ⋮ On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees ⋮ Permutations generated by token passing in graphs ⋮ Extreme value statistics of correlated random variables: a pedagogical review ⋮ The average height of r-tuply rooted planted plane trees ⋮ Enumeration of partial Łukasiewicz paths ⋮ Philippe Flajolet's early work in combinatorics ⋮ Combinatorial aspects of continued fractions ⋮ Trees with exponential height dependent weight ⋮ The average size of ordered binary subgraphs ⋮ On the average depth of a prefix of the Dycklanguage \(D_ 1\). ⋮ Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ A note on a result of R. Kemp on r-tuply rooted planted plane trees ⋮ On the number of deepest nodes in ordered trees ⋮ Enumerations of plane trees with multiple edges and Raney lattice paths ⋮ A three-way correspondence between partitions ⋮ The average height of binary trees and other simple trees ⋮ The outer-distance of nodes in random trees ⋮ An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees ⋮ Two Bessel bridges conditioned never to collide, double Dirichlet series, and Jacobi theta function ⋮ Random real trees ⋮ Two-sided prudent walks: a solvable non-directed model of polymer adsorption ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ On some problems about ternary paths: a linear algebra approach ⋮ On the Most Probable Shape of a Search Tree Grown from a Random Permutation ⋮ Analysis of bidirectional ballot sequences and random walks ending in their maximum ⋮ Unnamed Item ⋮ Bijections for a class of labeled plane trees ⋮ Reinforced weak convergence of stochastic processes ⋮ On the Stack-Size of General Tries ⋮ The shape of unlabeled rooted random trees ⋮ Laws relating runs and steps in gambler's ruin ⋮ Production matrices ⋮ Combinatorial aspects of continued fractions. (Reprint) ⋮ Asymptotics for logical limit laws: When the growth of the components is in an RT class ⋮ On the recursion depth of special tree traversal algorithms ⋮ The number of maximal independent sets of \((k+1)\)-valent trees ⋮ The stack-size of tries: A combinatorial study ⋮ On \(q\)-functional equations and excursion moments ⋮ The number of directed \(k\)-convex polyominoes ⋮ Analytic analysis of algorithms ⋮ The Sock Problem Revisited ⋮ Associative spectra of graph algebras. I: Foundations, undirected graphs, antiassociative graphs ⋮ The shape of stretched planar trees ⋮ The average number of registers needed to evaluate a binary tree optimally ⋮ Variations of the Catalan numbers from some nonassociative binary operations ⋮ Asymptotic analysis of regular sequences ⋮ The combinatorics of N. G. de Bruijn ⋮ Words with a generalized restricted growth property ⋮ The number of registers required for evaluating arithmetic expressions ⋮ Logarithms of a binomial series: A Stirling number approach ⋮ The cycle lemma and some applications ⋮ The properties of random trees ⋮ On exact simulation algorithms for some distributions related to Jacobi theta functions ⋮ On the average oscillation of a stack ⋮ Deepest nodes in marked ordered trees ⋮ On the average number of nodes in a subtree of a tree ⋮ Trees with power-like height dependent weight ⋮ Why Delannoy numbers? ⋮ The average height of planted plane trees with M leaves ⋮ On the number of combinations without a fixed distance ⋮ The average height of the second highest leaf of a planted plane tree ⋮ Asymptotic results on the maximal deviation of simple random walks ⋮ Two short proofs of Kemp's identity for rooted plane trees ⋮ On the Average Shape of Binary Trees
This page was built for publication:
