On the size of paged recursive trees

DOI10.1142/S1793830917500215zbMATH Open1365.60017OpenAlexW2587761436MaRDI QIDQ5347255FDOQ5347255

Authors: 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

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

zbMATH Keywords

asymptotic normalitypagingrandom recursive treescontraction method

Mathematics Subject Classification ID

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

Cites Work

• Random Trees
• Title not available (Why is that?)
• A general limit theorem for recursive algorithms and combinatorial structures
• The contraction method for recursive algorithms
• On a multivariate contraction method for random recursive structures with applications to quicksort
• Probability metrics and recursive algorithms
• A limit theorem for “quicksort”
• Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
• Branching structure of uniform recursive trees
• Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces
• Memory management for B-trees
• Page usage in a quadtree index
• Limit theorems for subtree size profiles of increasing trees
• Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
• Title not available (Why is that?)

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)