 |
Discrete Mathematics & Theoretical Computer Science |
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.2765Renewal theory in analysis of tries and strings: Extended abstractConference paper
- 1 Department of Mathematics [Uppsala]
- 2 Uppsala University
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.
Source: HAL:hal-01185563v1
Volume: DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
Section: Proceedings
Published on: January 1, 2010
Imported on: January 31, 2017
Keywords: [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [en] tries, random strings, Tunstall code, Khodak code
1 Document citing this article
Consultation statistics
This page has been seen 320 times.
This article's PDF has been downloaded 290 times.