Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model. - Ralph Neininger; Kevin Leckey; Wojciech Szpankowski (SODA, 2013)

Asymptotic Analysis of Hoppe Trees. - Kevin Leckey; Ralph Neininger (J. Appl. Probab., 2013)

A Limit Theorem for Radix Sort and Tries with Markovian Input. - Kevin Leckey; Ralph Neininger; Wojciech Szpankowski (CoRR, 2015)

Process convergence for the complexity of Radix Selection on Markov sources. - Kevin Leckey; Ralph Neininger; Henning Sulzbach (CoRR, 2016)

A Limit Theorem for the Six-length of Random Functional Graphs with a Fixed Degree Sequence. - Kevin Leckey; Nick Wormald (Electron. J. Comb., 2019)

On densities for solutions to stochastic fixed point equations. - Kevin Leckey (Random Struct. Algorithms, 2019)

Prediction intervals for load-sharing systems in accelerated life testing. - Kevin Leckey; Christine H. Müller; Sebastian Szugat; Reinhard Maurer (Qual. Reliab. Eng. Int., 2020)

The height of depth-weighted random recursive trees. - Kevin Leckey; Dieter Mitsche; Nick Wormald (Random Struct. Algorithms, 2020)