Pages that link to "Item:Q1171885"

The following pages link to The average height of binary trees and other simple trees (Q1171885):

Displaying 50 items.

• XML compression via directed acyclic graphs (Q269349) (← links)
• The shape of random tanglegrams (Q281899) (← links)
• The height of multiple edge plane trees (Q291297) (← links)
• The shape of random pattern-avoiding permutations (Q401507) (← links)
• On the recursion depth of special tree traversal algorithms (Q579943) (← links)
• Gaussian limiting distributions for the number of components in combinatorial structures (Q582688) (← links)
• The shape of unlabeled rooted random trees (Q710724) (← links)
• Random graphs from a block-stable class (Q739054) (← links)
• The cycle lemma and some applications (Q751658) (← links)
• Matrice de ramification des arbres binaires. (Ramification matrices of binary trees) (Q809098) (← links)
• A distance metric on binary trees using lattice-theoretic measures (Q910191) (← links)
• Itô's excursion theory and random trees (Q972813) (← links)
• On exact simulation algorithms for some distributions related to Jacobi theta functions (Q1036738) (← links)
• Listing and counting subtrees of equal size of a binary tree (Q1055196) (← links)
• The average height of the second highest leaf of a planted plane tree (Q1058519) (← links)
• Bandwidths and profiles of trees (Q1073038) (← links)
• Brownian motion and algorithm complexity (Q1082076) (← links)
• Finding the two-core of a tree (Q1086244) (← links)
• Analytic models and ambiguity of context-free languages (Q1088414) (← links)
• Monotonically labelled Motzkin trees (Q1092056) (← links)
• Level number sequences for trees (Q1096638) (← links)
• Random walks, Gaussian processes and list structures (Q1102637) (← links)
• Uniform random generation of expressions respecting algebraic identities (Q1179541) (← links)
• The asymptotic contour process of a binary tree is a Brownian excursion (Q1198554) (← links)
• The asymptotic distribution of leaf heights in binary trees (Q1199121) (← links)
• A note on subtrees rooted along the primary path of a binary tree (Q1209153) (← links)
• The expected additive weight of trees (Q1262116) (← links)
• Uniform generation of forests of restricted height (Q1330666) (← links)
• Multiprocessor simulation strategies with optimal speed-up (Q1349734) (← links)
• On the number of induced subgraphs of trees (Q1356487) (← links)
• Simulating theta random variates (Q1359731) (← links)
• A stochastically quasi-optimal search algorithm for the maximum of the simple random walk (Q1429105) (← links)
• Heavy subtrees of Galton-Watson trees with an application to Apollonian networks (Q1721992) (← links)
• The properties of random trees (Q1825678) (← links)
• On the average oscillation of a stack (Q1836670) (← links)
• Analytic methods in asymptotic enumeration (Q1917527) (← links)
• Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees (Q1951700) (← links)
• Trees with power-like height dependent weight (Q2084836) (← links)
• Two results about the Sackin and Colless indices for phylogenetic trees and their shapes (Q2105803) (← links)
• The Sackin index of simplex networks (Q2163945) (← links)
• The Horton-Strahler number of conditioned Galton-Watson trees (Q2243907) (← links)
• An analysis of budgeted parallel search on conditional Galton-Watson trees (Q2309473) (← links)
• Counting phylogenetic networks (Q2343474) (← links)
• Average case analysis for tree labelling schemes (Q2371804) (← links)
• Effective resistance of random trees (Q2389604) (← links)
• Fringe analysis of plane trees related to cutting and pruning (Q2413326) (← links)
• The continuum limit of critical random graphs (Q2428503) (← links)
• Extremal statistics on non-crossing configurations (Q2449168) (← links)
• Random real trees (Q2458943) (← links)
• A distributional study of the path edge-covering numbers for random trees (Q2482101) (← links)