The average height of binary trees and other simple trees
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3645115 (Why is no real title available?)
- scientific article; zbMATH DE number 3177815 (Why is no real title available?)
- scientific article; zbMATH DE number 3694604 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3390782 (Why is no real title available?)
- Asymptotic Methods in Enumeration
- On the Altitude of Nodes in Random Trees
- On the Order of Random Channel Networks
- On the height of trees
- On the performance evaluation of extendible hashing and trie searching
- Periodic oscillations of coefficients of power series that satisfy functional equations
- The Enumeration of Trees by Height and Diameter
- The average number of registers needed to evaluate a binary tree optimally
- The number of registers required for evaluating arithmetic expressions
Cited in
(81)- The continuum limit of critical random graphs
- Critical random graphs and the structure of a minimum spanning tree
- The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
- A complexity calculus for recursive tree algorithms
- Monotonically labelled Motzkin trees
- On random cartesian trees
- On functional graphs of quadratic polynomials
- The shape of random pattern-avoiding permutations
- The Distribution of Heights of Binary Trees and Other Simple Trees
- Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
- Two results about the Sackin and Colless indices for phylogenetic trees and their shapes
- Brownian motion and algorithm complexity
- scientific article; zbMATH DE number 3829270 (Why is no real title available?)
- Uniform random generation of expressions respecting algebraic identities
- Components of Random Forests
- On the number of induced subgraphs of trees
- XML compression via directed acyclic graphs
- Analysis of three graph parameters for random trees
- Analytic models and ambiguity of context-free languages
- The shape of unlabeled rooted random trees
- The shape of random tanglegrams
- The asymptotic distribution of leaf heights in binary trees
- Gaussian limiting distributions for the number of components in combinatorial structures
- The height of multiple edge plane trees
- On the Average Size of Glushkov’s Automata
- Extremal statistics on non-crossing configurations
- On the recursion depth of special tree traversal algorithms
- Bandwidths and profiles of trees
- The Horton-Strahler number of conditioned Galton-Watson trees
- Random real trees
- On the peel number and the leaf-height of Galton–Watson trees
- A distance metric on binary trees using lattice-theoretic measures
- Random graphs from a block-stable class
- Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
- Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)
- A distributional study of the path edge-covering numbers for random trees
- New equidistributions on plane trees and decompositions of \(132\)-avoiding permutations
- Average case analysis for tree labelling schemes
- Ladder variables, internal structure of Galton–Watson trees and finite branching random walks
- DEGREE-BASED GINI INDEX FOR GRAPHS
- Analytic methods in asymptotic enumeration
- The cycle lemma and some applications
- Isomorphism and symmetries in random phylogenetic trees
- Reinforced weak convergence of stochastic processes
- Level number sequences for trees
- The Sackin index of simplex networks
- On exact simulation algorithms for some distributions related to Jacobi theta functions
- Itô's excursion theory and random trees
- scientific article; zbMATH DE number 7561695 (Why is no real title available?)
- Uniform generation of forests of restricted height
- Simplifications of Uniform Expressions Specified by Systems
- Finding the two-core of a tree
- Random trees have height \(O(\sqrt{n})\)
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- Current trends in asymptotics: Some problems and some solutions
- On the average oscillation of a stack
- Simulating theta random variates
- A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
- Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations
- Multiprocessor simulation strategies with optimal speed-up
- The average height of the second highest leaf of a planted plane tree
- Effective resistance of random trees
- Listing and counting subtrees of equal size of a binary tree
- Fringe analysis of plane trees related to cutting and pruning
- Universal Limit Laws for Depths in Random Trees
- The asymptotic contour process of a binary tree is a Brownian excursion
- Counting phylogenetic networks
- The expected additive weight of trees
- The shape of stretched planar trees
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- A note on subtrees rooted along the primary path of a binary tree
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- The properties of random trees
- On the Joint Path Length Distribution in Random Binary Trees
- An analysis of budgeted parallel search on conditional Galton-Watson trees
- scientific article; zbMATH DE number 3909754 (Why is no real title available?)
- Trees with power-like height dependent weight
- Random walks, Gaussian processes and list structures
- The effects of semantic simplifications on random \textit{BST}-like expression-trees
- The distribution of height and diameter in random non-plane binary trees
- On the combinatorics of leftist trees
This page was built for publication: The average height of binary trees and other simple trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1171885)
