Kevin Leckey

According to our database, Kevin Leckey authored at least 9 papers between 2013 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

<i>K</i> -depth tests for testing simultaneously independence and other model assumptions in time series.

Hendrik Dohme, Dennis Malchercyzk, Kevin Leckey, Christine H. Müller

Commun. Stat. Simul. Comput., March, 2026

2020

The height of depth-weighted random recursive trees.

Kevin Leckey, Dieter Mitsche, Nick Wormald

Random Struct. Algorithms, 2020

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

2019

On densities for solutions to stochastic fixed point equations.

Kevin Leckey

Random Struct. Algorithms, 2019

A Limit Theorem for the Six-length of Random Functional Graphs with a Fixed Degree Sequence.

Kevin Leckey, Nick Wormald

Electron. J. Comb., 2019

2016

Process convergence for the complexity of Radix Selection on Markov sources.

Kevin Leckey, Ralph Neininger, Henning Sulzbach

CoRR, 2016

2015

A Limit Theorem for Radix Sort and Tries with Markovian Input.

Kevin Leckey, Ralph Neininger, Wojciech Szpankowski

CoRR, 2015

2013

Asymptotic Analysis of Hoppe Trees.

Kevin Leckey, Ralph Neininger

J. Appl. Probab., 2013

Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model.

Ralph Neininger, Kevin Leckey, Wojciech Szpankowski

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013