On the size of paged recursive trees
From MaRDI portal
Publication:5347255
Recommendations
- On the distribution of leaves in rooted subtrees of recursive trees
- On the distribution of distances in recursive trees
- On the structure of random plane‐oriented recursive trees and their branches
- On the variety of shapes on the fringe of a random recursive tree
- On the number of leaves in a random recursive tree
Cites work
- scientific article; zbMATH DE number 49698 (Why is no real title available?)
- scientific article; zbMATH DE number 219270 (Why is no real title available?)
- A general limit theorem for recursive algorithms and combinatorial structures
- A limit theorem for “quicksort”
- Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces
- Branching structure of uniform recursive trees
- Limit theorems for subtree size profiles of increasing trees
- Memory management for B-trees
- On a multivariate contraction method for random recursive structures with applications to quicksort
- Page usage in a quadtree index
- Probability metrics and recursive algorithms
- Random Trees
- Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
- The contraction method for recursive algorithms
- Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
This page was built for publication: On the size of paged recursive trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347255)
