Tsung-Hsi Tsai

Svante Janson

Adv. Appl. Math., April, 2024

Periodic minimum in the count of binomial coefficients not divisible by a prime.

[BibT_eX]

[DOI]

Svante Janson

CoRR, 2024

2018

Probabilistic Analysis of the (1+1)-Evolutionary Algorithm.

[BibT_eX]

[DOI]

Evol. Comput., 2018

2017

Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications.

[BibT_eX]

[DOI]

Svante Janson

ACM Trans. Algorithms, 2017

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

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

2015

Random unfriendly seating arrangement in a dining table.

[BibT_eX]

[DOI]

Hua-Huai Chern

Adv. Appl. Math., 2015

2013

Threshold Phenomena in k-Dominant Skylines of Random Samples.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

2012

Maxima-finding algorithms for multidimensional samples: A two-phase approach.

[BibT_eX]

[DOI]

Comput. Geom., 2012

2009

Efficient computation of the iteration of functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Simple, efficient maxima-finding algorithms for multidimensional samples

[BibT_eX]

[DOI]

CoRR, 2009

2006

Average case analysis of the Boyer-Moore algorithm.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

2005

Maxima in hypercubes.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

2003

An asymptotic theory for recurrence relations based on minimization and maximization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Efficient maxima-finding algorithms for random planar samples.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2003

2002

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

[BibT_eX]

[DOI]

Hua-Huai Chern

J. Algorithms, 2002

Quickselect And The Dickman Function.

[BibT_eX]

[DOI]