Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Wei‐Mei Chen
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
PDF
Chat
Probabilistic Analysis of the (1+1)-Evolutionary Algorithm
2017
Hsien‐Kuei Hwang
Alois Panholzer
Nicolas Rolin
Tsung‐Hsi Tsai
Wei‐Mei Chen
+
Probabilistic analysis of the (1+1)-evolutionary algorithm
2014
Hsien‐Kuei Hwang
Alois Panholzer
Nicolas Rolin
Tsung‐Hsi Tsai
Wei‐Mei Chen
+
PDF
Chat
Threshold Phenomena in $k$-Dominant Skylines of Random Samples
2013
Hsien‐Kuei Hwang
Tsung‐Hsi Tsai
Wei‐Mei Chen
+
PDF
Chat
Maxima-finding algorithms for multidimensional samples: A two-phase approach
2011
Wei‐Mei Chen
Hsien‐Kuei Hwang
Tsung‐Hsi Tsai
+
Threshold phenomena in k-dominant skylines of random samples
2011
Hsien‐Kuei Hwang
Tsung‐Hsi Tsai
Wei‐Mei Chen
+
Simple, efficient maxima-finding algorithms for multidimensional samples
2009
Wei‐Mei Chen
Hsien‐Kuei Hwang
Tsung‐Hsi Tsai
+
Cost distribution of the Chang–Roberts leader election algorithm and related problems
2006
Wei‐Mei Chen
+
Probabilistic analysis of algorithms for the Dutch national flag problem
2005
Wei‐Mei Chen
+
PDF
Chat
Generalized Diameters of the Mesh of Trees
2004
Wei‐Mei Chen
Gen-Huey Chen
D. Frank Hsu
+
Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
2003
Wei‐Mei Chen
Hsien‐Kuei Hwang
+
PDF
Chat
Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
2003
Wei‐Mei Chen
Gen-Huey Chen
+
PDF
Chat
Efficient maxima-finding algorithms for random planar samples
2003
Wei‐Mei Chen
Hsien‐Kuei Hwang
Tsung‐Hsi Tsai
Common Coauthors
Coauthor
Papers Together
Hsien‐Kuei Hwang
8
Tsung‐Hsi Tsai
7
Gen-Huey Chen
2
Nicolas Rolin
2
Alois Panholzer
2
D. Frank Hsu
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
PDF
Chat
Limit Theorems for the Number of Maxima in Random Samples from Planar Regions
2001
Zhidong Bai
Hsien‐Kuei Hwang
Wen-Qi Liang
Tsung‐Hsi Tsai
6
+
Asymptotic Estimates of Elementary Probability Distributions
1997
Hsien‐Kuei Hwang
3
+
PDF
Chat
On the variance of the number of maxima in random vectors and its applications
1998
Zhidong Bai
Chern-Ching Chao
Hsien‐Kuei Hwang
Wen-Qi Liang
3
+
PDF
Chat
A provably fast linear-expected-time maxima-finding algorithm
1994
Mordecai J. Golin
3
+
Maxima in hypercubes
2005
Zhidong Bai
Luc Devroye
Hsien‐Kuei Hwang
Tsung‐Hsi Tsai
3
+
Exact asymptotics of divide-and-conquer recurrences
1993
Philippe Flajolet
Mordecai J. Golin
3
+
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
2002
Hsien‐Kuei Hwang
Ralph Neininger
3
+
Maxima in convex regions
1993
Mordecai J. Golin
2
+
On Convergence Rates in the Central Limit Theorems for Combinatorial Structures
1998
Hsien‐Kuei Hwang
2
+
PDF
Chat
Variance asymptotics and central limit theorems for generalized growth processes with applications to convex hulls and maximal points
2007
T. Schreiber
J. E. Yukich
2
+
On random cartesian trees
1994
Luc Devroye
2
+
PDF
Chat
Multivariate Records Based on Dominance
2010
Hsien‐Kuei Hwang
Tsung‐Hsi Tsai
2
+
PDF
Chat
Multiplicative Drift Analysis
2012
Carola Doerr
Daniel Johannsen
Carola Winzen
2
+
PDF
Chat
On expected number of maximal points in polytopes
2007
Yuliy Baryshnikov
2
+
On the distribution of the length of the longest increasing subsequence of random permutations
1999
Jinho Baik
Percy Deift
Kurt Johansson
2
+
PDF
Chat
The Chain Records
2007
Alexander Gnedin
2
+
PDF
Chat
Rooted edges of a minimal directed spanning tree on random points
2006
Zhidong Bai
Sung Chul Lee
Mathew D. Penrose
2
+
PDF
Chat
Efficient maxima-finding algorithms for random planar samples
2003
Wei‐Mei Chen
Hsien‐Kuei Hwang
Tsung‐Hsi Tsai
2
+
PDF
Chat
Hypergeometrics and the cost structure of quadtrees
1995
Philippe Flajolet
Gilbert Labelle
Louise Laforest
Bruno Salvy
2
+
PDF
Chat
The longest chain among random points in Euclidean space
1988
Béla Bollobás
Peter Winkler
2
+
PDF
Chat
Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding
2005
Véronique Ladret
2
+
PDF
Chat
On a random directed spanning tree
2004
Abhay G. Bhatt
R. Roy
2
+
Asymptotics of linear recurrences
2014
R. Wong
1
+
PDF
Chat
Singularity Analysis of Generating Functions
1990
Philippe Flajolet
Andrew Odlyzko
1
+
A multivariate view of random bucket digital search trees
2002
Friedrich Hubalek
Hsien‐Kuei Hwang
William D. Lew
Hosam M. Mahmoud
Helmut Prodinger
1
+
Some Recurrence Relations of Recursive Minimization
1982
C. J. K. Batty
M. J. Pelling
Douglas G. Rogers
1
+
PDF
Chat
On the distribution for the duration of a randomized leader election algorithm
1996
James Allen Fill
Hosam M. Mahmoud
Wojciech Szpankowski
1
+
Fault-tolerant routing in circulant networks and cycle prefix networks
1998
Sheng-Chyang Liaw
Gerald J. Chang
Feng Cao
D. Frank Hsu
1
+
On the equivalence of some rectangle problems
1982
Herbert Edelsbrunner
Mark H. Overmars
1
+
Random linear programs with many variables and few constraints
1986
Charles Blair
1
+
PDF
Chat
Mellin transforms and asymptotics: Finite differences and Rice's integrals
1995
Philippe Flajolet
Robert Sedgewick
1
+
Mellin transforms and asymptotics: digital sums
1994
Philippe Flajolet
Peter J. Grabner
Peter Kirschenhofer
Helmut Prodinger
Robert F. Tichy
1
+
Asymptotic Statistics
1998
Aad van der Vaart
1
+
Phase changes in random <i>m</i>‐ary search trees and generalized quicksort
2001
Hua‐Huai Chern
Hsien‐Kuei Hwang
1
+
Recurrence relations on heaps
1996
Rachele Sprugnoli
1
+
Total Path Length for Random Recursive Trees
1999
Robert P. Dobrow
James Allen Fill
1
+
PDF
Chat
Berry-Esseen Bounds for the Number of Maxima in Planar Regions
2003
Zhidong Bai
Hsien‐Kuei Hwang
Tsung‐Hsi Tsai
1
+
Quickselect and Dickman function
2001
Hsien‐Kuei Hwang
Tsung‐Hsi Tsai
1
+
Admissibility: Survey of a Concept in Progress
1995
Andrew L. Rukhin
1
+
Introduction to Algorithms
1991
V. J. Rayward‐Smith
Thomas H. Cormen
Charles E. Leiserson
Ronald L. Rivest
1
+
Generalized Heapsort
1980
Seiichi Okoma
1
+
Enumerative Combinatorics
1997
Richard P. Stanley
Gian‐Carlo Rota
1
+
OneMax in Black-Box Models with Several Restrictions
2015
Carola Doerr
Johannes Lengler
1
+
Interval finding and its application to data mining
1997
Takeshi Fukuda
Yasuhiko Morimoto
Shinichi Morishita
Takeshi Tokuyama
1
+
Handbook of Combinatorics
1995
Ronald Graham
Martin Grötschel
László Lovász
1
+
Asymptotic Enumeration Methods
1995
Andrew Odlyzko
1
+
How to select a loser
1993
Helmut Prodinger
1
+
Extremal Graph Theory
1978
Béla Bollobás
1
+
On the Number of Heaps and the Cost of Heap Construction
2002
Hwang Hsien-Kuei
Steyaert Jean-Marc
1
+
Introduction to Analytic and Probabilistic Number Theory
2015
Gérald Tenenbaum
1