Hsien-Kuei Hwang
Orcid: 0000-0002-9410-6476
According to our database1,
Hsien-Kuei Hwang
authored at least 71 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Identities and periodic oscillations of divide-and-conquer recurrences splitting at half.
Adv. Appl. Math., April, 2024
CoRR, 2024
Periodic Behavior of the Minimal Colijn-Plazzotta Rank for Trees with a Fixed Number of Leaves.
Proceedings of the 35th International Conference on Probabilistic, 2024
2023
Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow.
Random Struct. Algorithms, March, 2023
A Curious Identity Arising From Stirling's Formula and Saddle-Point Method on Two Different Contours.
Electron. J. Comb., 2023
2022
Bell Numbers in Matsunaga's and Arima's Genjikō Combinatorics: Modern Perspectives and Local Limit Theorems.
Electron. J. Comb., 2022
2021
Random Struct. Algorithms, 2021
J. Comb. Theory A, 2021
Phase transitions from exp(n1/2) to exp(n2/3) in the asymptotics of banded plane partitions.
J. Comb. Theory A, 2021
2020
Adv. Appl. Math., 2020
2019
Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019
2018
Proceedings of the 29th International Conference on Probabilistic, 2018
Proceedings of the 29th International Conference on Probabilistic, 2018
2017
Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications.
ACM Trans. Algorithms, 2017
Generating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation.
ACM Trans. Algorithms, 2017
Random Struct. Algorithms, 2017
From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader.
J. Appl. Probab., 2017
J. Appl. Probab., 2017
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017
2016
2015
Random Struct. Algorithms, 2015
2014
An analytic approach to the asymptotic variance of trie statistics and related structures.
Theor. Comput. Sci., 2014
Analysis of an Exhaustive Search Algorithm in Random Graphs and the n<sup>clog n</sup>-Asymptotics.
SIAM J. Discret. Math., 2014
Psi-series method for equality of random trees and quadratic convolution recurrences.
Random Struct. Algorithms, 2014
J. Appl. Probab., 2014
2013
2012
Analysis of an exhaustive search algorithm in random graphs and the n<sup>c log n</sup>-asymptotics.
CoRR, 2012
Comput. Geom., 2012
2010
Discret. Math. Theor. Comput. Sci., 2010
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010
2009
2008
2007
Random Struct. Algorithms, 2007
2006
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees.
Algorithmica, 2006
2005
Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees.
SIAM J. Discret. Math., 2005
Random Struct. Algorithms, 2005
2003
An asymptotic theory for recurrence relations based on minimization and maximization.
Theor. Comput. Sci., 2003
Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model.
J. Algorithms, 2003
Discret. Math. Theor. Comput. Sci., 2003
2002
SIAM J. Comput., 2002
An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms.
J. Algorithms, 2002
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002
2001
Theor. Comput. Sci., 2001
Random Struct. Algorithms, 2001
J. Comb. Theory A, 2001
Algorithmica, 2001
2000
1999
J. Algorithms, 1999
1998
A Poisson * Negative Binomial Convolution Law for Random Polynomials over Finite Fields.
Random Struct. Algorithms, 1998
Normal approximations of the number of records in geometrically distributed random variables.
Random Struct. Algorithms, 1998
Eur. J. Comb., 1998
A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures.
Comb. Probab. Comput., 1998
Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic.
Algorithmica, 1998
1997
IEEE Trans. Inf. Theory, 1997
A constant arising from the analysis of algorithms for determining the maximum of a random walk.
Random Struct. Algorithms, 1997
1996