On the size of paged recursive trees

DOI10.1142/S1793830917500215zbMath1365.60017OpenAlexW2587761436MaRDI QIDQ5347255

Mehri Javanian

Publication date: 23 May 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830917500215

zbMATH Keywords

asymptotic normalitycontraction methodpagingrandom recursive trees

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Unnamed Item
• Page usage in a quadtree index
• A general limit theorem for recursive algorithms and combinatorial structures
• The contraction method for recursive algorithms
• Branching structure of uniform recursive trees
• On a multivariate contraction method for random recursive structures with applications to Quicksort
• Limit Theorems for Subtree Size Profiles of Increasing Trees
• Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
• Random Trees
• Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
• Memory management for B-trees
• Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces
• Probability metrics and recursive algorithms
• A limit theorem for “quicksort”

This page was built for publication: On the size of paged recursive trees