Limit laws for two distance-based indices in random recursive tree models
From MaRDI portal
Publication:2674149
Recommendations
Cites work
- A limit theorem for “quicksort”
- Distances in random plane-oriented recursive trees
- scientific article; zbMATH DE number 3723610 (Why is no real title available?)
- scientific article; zbMATH DE number 1552326 (Why is no real title available?)
- Level of nodes in increasing trees revisited
- Limiting Distributions for Path Lengths in Recursive Trees
- On the analysis of stochastic divide and conquer algorithms
- ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
- On the complexity of algorithms on recursive trees
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- On the structure of random plane‐oriented recursive trees and their branches
- Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
- Probability metrics and recursive algorithms
- Profiles of random trees: Plane-oriented recursive trees
- Random Trees
- The contraction method for recursive algorithms
- Total Path Length for Random Recursive Trees
Cited in
(7)- Limit laws for the Randić index of random binary tree models
- The total Steiner k-distance for b-ary recursive trees and linear recursive trees
- Limit Theorems for the Inductive Mean on Metric Trees
- Limit theorems for functionals of recursive trees.
- Total Path Length for Random Recursive Trees
- The moments of the Sackin index of random d-ary increasing trees
- The Sackin index of random recursive trees
This page was built for publication: Limit laws for two distance-based indices in random recursive tree models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674149)