4 citations · 4 across the 2 of their papers we have counts for
3 papers
math.CO2018
A limit theorem for the six-length of random functional graphs with a fixed degree sequence
Kevin Leckey, Nicholas Wormald
We obtain results on the limiting distribution of the six-length of a random functional graph, also called a functional digraph or random mapping, with given in-degree sequence. Th…
math.PR2015★ 4 cited
A Limit Theorem for Radix Sort and Tries with Markovian Input
Kevin Leckey, Ralph Neininger, Wojciech Szpankowski
Tries are among the most versatile and widely used data structures on words. In particular, they are used in fundamental sorting algorithms such as radix sort which we study in thi…
math.PR2012
Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model
Kevin Leckey, Ralph Neininger, Wojciech Szpankowski
Tries are among the most versatile and widely used data structures on words. They are pertinent to the (internal) structure of (stored) words and several splitting procedures used…