Digital search trees with m trees: Level polynomials and insertion costs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2011

Digital search trees with m trees: Level polynomials and insertion costs

Résumé

We adapt a novel idea of Cichon's related to Approximate Counting to the present instance of Digital Search Trees, by using m (instead of one) such trees. We investigate the level polynomials, which have as coefficients the expected numbers of data on a given level, and the insertion costs. The level polynomials can be precisely described, thanks to formulae from q-analysis. The asymptotics of expectation and variance of the insertion cost are fairly standard these days and done with Rice's method.
Fichier principal
Vignette du fichier
2000-6434-1-PB.pdf (241.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00990489 , version 1 (13-05-2014)

Identifiants

Citer

Helmut Prodinger. Digital search trees with m trees: Level polynomials and insertion costs. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 3 (3), pp.1--7. ⟨10.46298/dmtcs.557⟩. ⟨hal-00990489⟩

Collections

TDS-MACS
26 Consultations
862 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More