scientific article; zbMATH DE number 3390782

zbMATH Open0247.05106MaRDI QIDQ5659554FDOQ5659554

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

Publication date: 1972

Title of this publication is not available (Why is that?)

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 (85)

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