Announcement: I have an open Ph.D. position in an international cooperation project between Taiwan and Austria which is concerned with stochastic, combinatorial and probabilistic aspects of discrete random structures. If you are currently doing or have finished a master in a related area and are interested in joining the project, feel free to contact me.
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).
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.