Branching processes in the analysis of the heights of trees
From MaRDI portal
(Redirected from Publication:1102045)
Recommendations
Cited in
(60)- Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
- Transversals in trees
- Archaeology of random recursive dags and Cooper-Frieze random networks
- Random trees have height \(O(\sqrt{n})\)
- Asymptotic fluctuations in supercritical Crump-Mode-Jagers processes
- Combinatorial differential operators in: Faà di Bruno formula, enumeration of ballot paths, enriched rooted trees and increasing rooted trees
- Community modulated recursive trees and population dependent branching processes
- The height of a random binary search tree
- Analytic methods in asymptotic enumeration
- Limit distribution for the maximum degree of a random recursive tree
- Hypergeometrics and the cost structure of quadtrees
- Weak convergence of the number of vertices at intermediate levels of random recursive trees
- A limit process for partial match queries in random quadtrees and 2-d trees
- Search problems in groups and branching processes.
- A phase transition for the heights of a fragmentation tree
- Limiting theorems for the nodes in binary search trees
- Height-analysis of k-dimensional leaf and node height-balanced trees: A new approach
- Weighted height of random trees
- The variance of the height of binary search trees
- The longest minimum-weight path in a complete graph
- Applications of the theory of records in the study of random trees
- Analytic analysis of algorithms
- The height of random k‐trees and related branching processes
- On the expected height of fringe-blanced trees
- Retracted: Strong limiting behavior in binary search trees
- On the concentration of the height of binary search trees
- \(D\cdot E\cdot K=(100)_8\)
- Correction terms for the height of weighted recursive trees
- The shape of random pattern-avoiding permutations
- Poisson-Dirichlet branching random walks
- A limit field for orthogonal range searches in two-dimensional random point search trees
- The profile of binary search trees
- A non-increasing tree growth process for recursive trees and applications
- Diameter of the stochastic mean-field model of distance
- Limit laws for local counters in random binary search trees
- On random cartesian trees
- A functional limit theorem for the profile of random recursive trees
- On the height of random m‐ary search trees
- Martingales and large deviations for binary search trees
- Geometry of weighted recursive and affine preferential attachment trees
- A functional limit theorem for the profile of \(b\)-ary trees
- High degrees in recursive trees
- A note on the growth of random trees
- On Robson's convergence and boundedness conjectures concerning the height of binary search trees
- Long and short paths in uniform random recursive dags
- Depth properties of scaled attachment random recursive trees
- Analytic variations on quadtrees
- Oscillations in the height of the Yule tree and application to the binary search tree
- Note on the heights of random recursive trees and random m‐ary search trees
- Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
- Critical random graphs and the structure of a minimum spanning tree
- On the internal path length ofd-dimensional quad trees
- Probabilistic analysis of bucket recursive trees
- The strong convergence of maximal degrees in uniform random recursive trees and dags
- Bounded branching process and and/or tree evaluation
- The height of increasing trees
- General Edgeworth expansions with applications to profiles of random trees
- EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
- The height of a binary search tree: the limiting distribution perspective.
- Finding Adam in random growing trees
This page was built for publication: Branching processes in the analysis of the heights of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102045)
