4 citations · 4 across the 2 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
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…