Phase changes in randomm-ary search trees and generalized quicksort
From MaRDI portal
Publication:2772923
DOI10.1002/rsa.10005zbMath0990.68052OpenAlexW2090041152MaRDI QIDQ2772923
Hsien-Kuei Hwang, Hua-Huai Chern
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.10005
Related Items (23)
Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees ⋮ The Class of Tenable Zero-Balanced Pólya Urn Schemes: Characterization and Gaussian Phases ⋮ Phase transition in a generalized Eden growth model on a tree ⋮ Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates ⋮ Unnamed Item ⋮ Balancing \(m\)-ary search trees with compressions on the fringe ⋮ Shape Measures of Random Increasing k-trees ⋮ Analysis of a generalized Friedman's urn with multiple drawings ⋮ Refined asymptotics for the composition of cyclic urns ⋮ Limit distributions for multitype branching processes of \(m\)-ary search trees ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ The size of random fragmentation trees ⋮ Dependence and phase changes in random m‐ary search trees ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ Limiting distributions for additive functionals on Catalan trees ⋮ Phase changes in randomm-ary search trees and generalized quicksort ⋮ A combinatorial approach to the analysis of bucket recursive trees ⋮ Width and mode of the profile for some random trees of logarithmic height ⋮ An algebraic approach to Pólya processes ⋮ Asymptotic joint normality of counts of uncorrelated motifs in recursive trees ⋮ Functional limit theorems for multitype branching processes and generalized Pólya urns. ⋮ Asymptotic analysis of an optimized quicksort algorithm. ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- On rotations in fringe-balanced binary trees
- Probabilistic analysis of bucket recursive trees
- On the average internal path length of m-ary search trees
- Improving time and space efficiency in generalized binary search trees
- Some average measures in m-ary search trees
- Periodic oscillations of coefficients of power series that satisfy functional equations
- On convergence rates in the central limit theorems for combinatorial structures
- Large deviations of combinatorial distributions. II: Local limit theorems
- An analytic approach for the analysis of rotations in fringe-balanced binary search trees
- Binary search trees constructed from nondistinct keys with/without specified probabilities
- Central limit theorems for urn models
- Normal convergence problem? Two moments and a recurrence may be the clues
- Variance of storage requirements for B+-trees
- Large deviations for combinatorial distributions. I: Central limit theorems
- Phase changes in randomm-ary search trees and generalized quicksort
- Singularity Analysis of Generating Functions
- Quicksort with Equal Keys
- Combinatorial analysis of quicksort algorithm
- Analysis of the space of search trees under the random insertion algorithm
- Universal Limit Laws for Depths in Random Trees
- On the internal path length ofd-dimensional quad trees
- The Joint Distribution of Elastic Buckets in Multiway Search Trees
This page was built for publication: Phase changes in randomm-ary search trees and generalized quicksort
