41 citations · 43 across the 6 of their papers we have counts for
Showing 2012 · math.PRShow all
2 papers · 2 filters
math.PR2012
Refined Quicksort asymptotics
Ralph Neininger
The complexity of the Quicksort algorithm is usually measured by the number of key comparisons used during its execution. When operating on a list of data, permuted uniformly a…
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…