Hsien-Kuei Hwang

According to our database1, Hsien-Kuei Hwang
  • authored at least 56 papers between 1996 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Generating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation.
ACM Trans. Algorithms, 2017

Dependence and phase changes in random m-ary search trees.
Random Struct. Algorithms, 2017

From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader.
J. Applied Probability, 2017

External Profile of Symmetric Digital Search Trees (Extended Abstract).
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016
Shape Measures of Random Increasing k-trees.
Combinatorics, Probability & Computing, 2016

Dependence between External Path-Length and Size in Random Tries.
CoRR, 2016

Increasing Diamonds.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Limit distribution of the coefficients of polynomials with only unit roots.
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 nclog n-Asymptotics.
SIAM J. Discrete Math., 2014

Psi-series method for equality of random trees and quadratic convolution recurrences.
Random Struct. Algorithms, 2014

A Binomial Splitting Process in Connection with Corner Parking Problems.
J. Applied Probability, 2014

Probabilistic analysis of the (1+1)-evolutionary algorithm.
CoRR, 2014

2013
Threshold Phenomena in k-Dominant Skylines of Random Samples.
SIAM J. Comput., 2013

An analytic approach to the asymptotic variance of trie statistics and related structures
CoRR, 2013

Guest Editorial.
Algorithmica, 2013

2012
Analysis of an exhaustive search algorithm in random graphs and the nc log n-asymptotics.
CoRR, 2012

Maxima-finding algorithms for multidimensional samples: A two-phase approach.
Comput. Geom., 2012

2011
Threshold phenomena in k-dominant skylines of random samples
CoRR, 2011

2010
Asymptotic variance of random symmetric digital search trees.
Discrete Mathematics & Theoretical Computer Science, 2010

The Connectivity-Profile of Random Increasing k-trees.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009
Profiles of Tries.
SIAM J. Comput., 2009

Simple, efficient maxima-finding algorithms for multidimensional samples
CoRR, 2009

2008
Profile of Tries.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Phase changes in random point quadtrees.
ACM Trans. Algorithms, 2007

Profiles of random trees: Plane-oriented recursive trees.
Random Struct. Algorithms, 2007

2006
Partial Match Queries in Random k-d Trees.
SIAM J. Comput., 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. Discrete Math., 2005

Limit distribution of the number of consecutive records.
Random Struct. Algorithms, 2005

Maxima in hypercubes.
Random Struct. Algorithms, 2005

2003
An asymptotic theory for recurrence relations based on minimization and maximization.
Theor. Comput. Sci., 2003

Partial Match Queries in Random Quadtrees.
SIAM J. Comput., 2003

Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model.
J. Algorithms, 2003

Efficient maxima-finding algorithms for random planar samples.
Discrete Mathematics & Theoretical Computer Science, 2003

2002
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions.
SIAM J. Comput., 2002

A multivariate view of random bucket digital search trees.
J. Algorithms, 2002

An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms.
J. Algorithms, 2002

Quickselect And The Dickman Function.
Combinatorics, Probability & Computing, 2002

Precise Average Redundancy Of An Idealized Arithmetic Codin.
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2001
Uniform asymptotics of some Abel sums arising in coding theory.
Theor. Comput. Sci., 2001

Phase changes in random m-ary search trees and generalized quicksort.
Random Struct. Algorithms, 2001

Limit Theorems for the Number of Summands in Integer Partitions.
J. Comb. Theory, Ser. A, 2001

Transitional Behaviors of the Average Cost of Quicksort with Median-of-(2t+1).
Algorithmica, 2001

2000
Presorting algorithms: An average-case point of view.
Theor. Comput. Sci., 2000

Distribution of the number of consecutive records.
Random Struct. Algorithms, 2000

1999
The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules.
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

On Convergence Rates in the Central Limit Theorems for Combinatorial Structures.
Eur. J. Comb., 1998

A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures.
Combinatorics, Probability & Computing, 1998

Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic.
Algorithmica, 1998

Asymptotic Expansions of the Mergesort Recurrences.
Acta Inf., 1998

1997
Optimal algorithms for inserting a random element into a random heap.
IEEE Trans. Information Theory, 1997

A constant arising from the analysis of algorithms for determining the maximum of a random walk.
Random Struct. Algorithms, 1997

1996
Limit theorems for mergesort.
Random Struct. Algorithms, 1996


  Loading...