The following pages link to (Q4868264):
Displaying 20 items.
- On the richness of the collection of subtrees in random binary search trees (Q293237) (← links)
- Limiting distributions for additive functionals on Catalan trees (Q703536) (← links)
- The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance (Q997423) (← links)
- Singularity analysis and asymptotics of Bernoulli sums (Q1285597) (← links)
- An asymptotic theory for recurrence relations based on minimization and maximization. (Q1401173) (← links)
- A general limit theorem for recursive algorithms and combinatorial structures (Q1431560) (← links)
- Normal convergence problem? Two moments and a recurrence may be the clues (Q1578596) (← links)
- Binary search tree recursions with harmonic toll functions (Q1612306) (← links)
- On the variety of shapes in digital trees (Q1692230) (← links)
- Singularity analysis, Hadamard products, and tree recurrences (Q1765441) (← links)
- On the distribution of the number of Young tableaux for a uniformly random diagram (Q1865261) (← links)
- Cost functionals for large (uniform and simply generated) random trees (Q1990219) (← links)
- The sum of powers of subtree sizes for conditioned Galton-Watson trees (Q2082709) (← links)
- The distributions under two species-tree models of the number of root ancestral configurations for matching gene trees and species trees (Q2108896) (← links)
- Mallows permutations and finite dependence (Q2184821) (← links)
- Multiway Trees of Maximum and Minimum Probability under the Random Permutation Model (Q2785369) (← links)
- On the Variety of Shapes on the Fringe of a Random Recursive Tree (Q3550998) (← links)
- An almost sure result for path lengths in binary search trees (Q4449502) (← links)
- Central Limit Theorems for Additive Tree Parameters with Small Toll Functions (Q5364224) (← links)
- Compaction for two models of logarithmic‐depth trees: Analysis and experiments (Q6074703) (← links)
