Approximate Counting via the Poisson-Laplace-Mellin
Method, (with C.-K.
Lee and H. Prodinger),
Discrete Math. Theor. Comput. Sci. Proc., Proceedings of the 23rd International
Meeting on Probabilistic, Combinatorial and Asymptotic
Methods for the Analysis of Algorithms, 13-28 (2012).
Enumeration of d-combining Tree-Child Networks,
(with Y.-S. Chang, H. Liu, M. Wallner and G.-R. Yu),
LIPICS, Proceedings of the 33rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 225, Paper 5 (2022).
The Node Profile of Symmetric
Digital Search Trees, talk given at 26th International Meeting on Probabilistic, Combinatorial and
Asymptotic Methods for the Analysis of Algorithms, Strobl, Austria, June 8, 2015.