Renewal theory in analysis of tries and strings: Extended abstract - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2010

Renewal theory in analysis of tries and strings: Extended abstract

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.

Domains

Data Structures and Algorithms [cs.DS] Combinatorics [math.CO] Discrete Mathematics [cs.DM] Computational Geometry [cs.CG]
Fichier principal
Vignette du fichier
dmAM0129.pdf (306.82 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Coordination Episciences Iam  : Connect in order to contact the contributor

https://inria.hal.science/hal-01185563

Submitted on : Thursday, August 20, 2015-4:31:55 PM

Last modification on : Tuesday, April 16, 2024-4:01:28 PM

Long-term archiving on : Wednesday, April 26, 2017-9:50:00 AM

Download

Dates and versions

hal-01185563 , version 1 (20-08-2015)

Identifiers

Cite

Svante Janson. Renewal theory in analysis of tries and strings: Extended abstract. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.415-426, ⟨10.46298/dmtcs.2765⟩. ⟨hal-01185563⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

TDS-MACS
53 View
581 Download

Altmetric

Share

More