The following pages link to Kevin Leckey (Q1713465):
Displaying 9 items.
- Process convergence for the complexity of radix selection on Markov sources (Q1713466) (← links)
- K-sign depth: from asymptotics to efficient implementation (Q2242867) (← links)
- A limit theorem for the six-length of random functional graphs with a fixed degree sequence (Q2278111) (← links)
- Analysis of radix selection on Markov sources (Q2789563) (← links)
- Asymptotic Analysis of Hoppe Trees (Q4918574) (← links)
- The height of depth‐weighted random recursive trees (Q5113959) (← links)
- On densities for solutions to stochastic fixed point equations (Q5381055) (← links)
- Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model (Q5741771) (← links)
- Simple powerful robust tests based on sign depth (Q6157044) (← links)
