H
Hsien-Kuei Hwang
Researcher at Academia Sinica
Publications - 127
Citations - 2435
Hsien-Kuei Hwang is an academic researcher from Academia Sinica. The author has contributed to research in topics: Asymptotic distribution & Poisson distribution. The author has an hindex of 27, co-authored 125 publications receiving 2283 citations. Previous affiliations of Hsien-Kuei Hwang include Graz University of Technology & École Polytechnique.
Papers
More filters
Journal ArticleDOI
On Convergence Rates in the Central Limit Theorems for Combinatorial Structures
TL;DR: A simple theorem is proved which applies to characterize the convergence rates in central limit theorems of Flajolet and Soria and is also applicable to arithmetical functions.
Journal ArticleDOI
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
Hsien-Kuei Hwang,Ralph Neininger +1 more
TL;DR: Many new examples ranging from the number of exchanges in quicksort to sorting on a broadcast communication model, from an in-situ permutation algorithm to tree traversal algorithms, etc are given.
Journal ArticleDOI
Phase changes in random m -ary search trees and generalized quicksort
Hua-Huai Chern,Hsien-Kuei Hwang +1 more
TL;DR: A uniform approach to describe the phase change of the limiting distribution of space measures in random m-ary search trees: the space requirement, when properly normalized, is asymptotically normally distributed for m≤26 and does not have a fixed limiting distribution for m>26.
Journal ArticleDOI
Large deviations for combinatorial distributions. I. Central limit theorems
TL;DR: In this paper, a general central limit theorem for probabilities of large deviations for sequences of random variables satisfying certain natural analytic conditions has been proved, which has wide applications to combinatorial structures and to the distribution of additive arithmetical functions.
Journal ArticleDOI
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
TL;DR: Convergence in distribution is proved for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio α of the level and the logarithm of tree size lies in [0,e).