Svante Janson
-
Renewal theory in analysis of tries and strings: Extended abstract
dmtcs:2765 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2010,
DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
-
https://doi.org/10.46298/dmtcs.2765
Renewal theory in analysis of tries and strings: Extended abstractArticle
We give a survey of a number of simple applications of renewal theory to problems on random strings, in particular to tries and Khodak and Tunstall codes.
Volume: DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
Nicolas Broutin;Cecilia Holmgren, 2012, The total path length of split trees, The Annals of applied probability/The annals of applied probability, 22, 5, 10.1214/11-aap812, https://doi.org/10.1214/11-aap812.