Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Renewal theory in an ...
Conference paper

Renewal theory in analysis of tries and strings: Extended abstract

Svante Janson (1) (2)
(1) Department of Mathematics [Uppsala]
(2) Uppsala University
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2009
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
Proceedings
DOI
10.46298/dmtcs.2765
License
https://about.hal.science/hal-authorisation-v1
Indicators
506
Views
455
Downloads

Renewal theory in analysis of tries and strings: Extended abstract

Svante Janson (1) (2)
(1) Department of Mathematics [Uppsala]
(2) Uppsala University
Abstract
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.
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]
  • tries
  • random strings
  • Tunstall code
  • Khodak code
Cited by

Source: OpenCitations

  • The total path length of split trees

    The Annals of Applied Probability

    Authors : Nicolas Broutin, Cecilia Holmgren

    Journal reference : Volume 22, 2012, pp.

    DOI : 10.1214/11-aap812
Preview
Loading PDF preview...