On a multivariate contraction method for random recursive structures with applications to Quicksort
From MaRDI portal
Publication:2772929
DOI10.1002/rsa.10010zbMath0990.68054MaRDI QIDQ2772929
Publication date: 19 February 2002
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10010
68P10: Searching and sorting
Related Items
Distances in random digital search trees, The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance, Limit laws for the Randić index of random binary tree models, A general limit theorem for recursive algorithms and combinatorial structures, Distribution of distances in random binary search trees., One-sided variations on binary search trees, Limiting theorems for the nodes in binary search trees, Limit distribution of distances in biased random tries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the joint distribution of the insertion path length and the number of comparisons in search trees
- Some asymptotic theory for the bootstrap
- A fixed point theorem for distributions
- Central and local limit theorems applied to asymptotic enumeration. IV: Multivariate generating functions
- The analysis of Quicksort programs
- On the invariance principle for sums of independent identically distributed random variables
- Analytic variations on quadtrees
- Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
- Some properties of a limiting distribution in Quicksort
- An Analysis of Randomd-Dimensional Quad Trees
- A limiting distribution for quicksort
- Large Deviations for Quicksort
- Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
- Combinatorial analysis of quicksort algorithm
- Universal Limit Laws for Depths in Random Trees
- The Joint Distribution of Elastic Buckets in Multiway Search Trees
- On the structure of random plane‐oriented recursive trees and their branches
- Hypergeometrics and the cost structure of quadtrees
- Increasing the efficiency of quicksort
- On the probability distribution of the values of binary trees
- A limit theorem for “quicksort”
- Convergence of two-dimensional branching recursions
