Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
2011 | A central limit theorem for random factorizations of integers | Hwang, H. -K.; Janson, S. | Electronic Journal of Probability 16,347-361 | | | |
2010 | A Charlier-Parseval approach to Poisson approximation and its applications | Zacharovas, V.; Hwang, H. -K. | Lithuanian Mathematical Journal 50(1), 88-119 | | | |
1997 | A constant arising from the analysis of algorithms for determining the maximum of a random walk | Hwang, H. -K. | Random Structures and Algorithms 10, 333-335 | | | |
2002 | A multivariate view of random bucket digital search trees | Hubalek, F.; Hwang, H. -K.; Lew, W.; Mahmoud, H. M.; Prodinger, H. | Journal of Algorithms 44, 121-158 | | | |
1998 | A Poisson *geometric convolution law for the number of components in unlabelled combinatorial structures, Combinatorics | Hwang, H. -K. | Combinatorics, Probability and Computing 7, 89-110 | | | |
1998 | A Poisson negative binomial convolution law for random polynomials over finite fields | Hwang, H. -K. | Random Structures and Algorithms 13, 17-47 | | | |
2002 | An asymptotic theory for Cauchy-Euler differential equations with applications to analysis of algorithms | Chern, H. -H.; Hwang, H. -K.; Tsai, T. -H. | Journal of Algorithms 44, 177-225 | | | |
2003 | An asymptotic theory for recurrence relations based on minimization and maximization. | Hwang, H. -K.; Tsai, T. -H. | Theoretical Computer Science 290, 1475-1501 | | | |
2003 | Analysis of two randomized algorithms for finding the maximum in a broadcast communication model. | Chen, W. -M.; Hwang, H. -K. | Journal of Algorithms 46(2), 140-177 | | | |
1996 | Asymptotic behaviour of some infinite products involving prime numbers | Hwang, H. -K. | Acta Arithmetica 75, 339-350 | | | |
1997 | Asymptotic estimates of elementary probability distributions | Hwang, H. -K. | Studies in Applied Mathematics 99, 393-417 | | | |
1996 | Asymptotic expansion for the Lebesgue constants of the Walsh system | Hwang, H. -K. | Journal of Computational and Applied Mathematics 71, 237-243 | | | |
1995 | Asymptotic expansions for the Stirling numbers of the first kind. | Hwang, H. -K. | Journal of Combinatorial Theory, Series A 71, 343-351 | | | |
1998 | Asymptotic expansions of the mergesort recurrences | Hwang, H. -K. | Acta Informatica 35, 911-919 | | | |
2010 | Asymptotic variance of random digital search trees | Hwang, H. -K.; Fuchs, M.; Zacharovas, V. | Discrete Mathematics & Theoretical Computer Science 12(2), 103-166) | | | |
1998 | Asymptotics of divide-and-conquer recurrences: Batcher’s sorting algorithm and a minimum Euclidean matching heuristic | Hwang, H. -K. | Algorithmica 22, 529-546 | | | |
1999 | Asymptotics of Poisson approximation to random discrete distributions: an analytic approach | Hwang, H. -K. | Advances in Applied Probability 31, 448-491 | | | |
2003 | Berry-Esseen bounds for the number of maxima in planar regions. | Bai, Z. -D.; Hwang, H. -K.; Tsai, T. -H. | Electronic Journal of Probability 8(Paper 9), 26-0 | | | |
2005 | Bimodality and phase transitions in the profile variance of random binary search trees. | Drmota, M.; Hwang, H. -K. | SIAM Journal on Discrete Mathematics 19(1), 19-45 | | | |
2005 | Digital sums and divide-and-conquer recurrences: Fourier expansions and absolute convergence. | Grabner, P.; Hwang, H. -K. | Constructive Approximation 21(2), 149-179 | | | |