scientific article; zbMATH DE number 852055
From MaRDI portal
Publication:4868264
Recommendations
Cited in
(37)- On the joint distribution of the insertion path length and the number of comparisons in search trees
- Permutation trees and variation statistics
- Singularity analysis and asymptotics of Bernoulli sums
- The joint distribution of the three types of nodes in uniform binary trees
- Binary search trees constructed from nondistinct keys with/without specified probabilities
- An asymptotic theory for recurrence relations based on minimization and maximization.
- A general limit theorem for recursive algorithms and combinatorial structures
- Normal convergence problem? Two moments and a recurrence may be the clues
- Binary search tree recursions with harmonic toll functions
- On the variety of shapes in digital trees
- Singularity analysis, Hadamard products, and tree recurrences
- On the distribution of the number of Young tableaux for a uniformly random diagram
- Cost functionals for large (uniform and simply generated) random trees
- The sum of powers of subtree sizes for conditioned Galton-Watson trees
- The distributions under two species-tree models of the number of root ancestral configurations for matching gene trees and species trees
- Mallows permutations and finite dependence
- Random binary trees: from the average case analysis to the asymptotics of distributions
- Multiway trees of maximum and minimum probability under the random permutation model
- Support and density of the limit m-ary search trees distribution
- On the richness of the collection of subtrees in random binary search trees
- On the variety of shapes on the fringe of a random recursive tree
- scientific article; zbMATH DE number 1741002 (Why is no real title available?)
- scientific article; zbMATH DE number 1080355 (Why is no real title available?)
- An almost sure result for path lengths in binary search trees
- Central limit theorems for additive tree parameters with small toll functions
- Uniform distribution modulo one and binary search trees
- A q-analogue of the path length of binary search trees
- Compaction for two models of logarithmic‐depth trees: Analysis and experiments
- The height of record‐biased trees
- Conditioned Galton-Watson trees: the shape functional, and more on the sum of powers of subtree sizes and its mean
- Binary search trees of permuton samples
- On the number of distinct fringe subtrees in binary search trees
- The GFB tree and tree imbalance indices
- Metaconcepts of rooted tree balance
- Limiting distributions for additive functionals on Catalan trees
- The left-right-imbalance of binary search trees
- The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance
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 Q4868264)