activity
20122018
most citedA Limit Theorem for Radix Sort and Tries with Markovian Input

4 citations · 5 across the 5 of their papers we have counts for

collaborators
Showing 2012Show all

2 papers · 1 filter

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…

math.PR2012

Asymptotic analysis of Hoppe trees

Kevin Leckey, Ralph Neininger

We introduce and analyze a random tree model associated to Hoppe's urn. The tree is built successively by adding nodes to the existing tree when starting with the single root node.…