scientific article; zbMATH DE number 3390782

MaRDI QIDQ5659554zbMATH OpenFDO

Authors Donald E. Knuth, Stephen Rice, N. G. de Bruijn

Publication date 1972

Mathematics Subject Classification ID

Trees (05C05) Information theory (general) (94A15) Asymptotic results on arithmetic functions (11N37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cited in

(84)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659554)