Geodesic
Digital search trees with m trees: Level polynomials and insertion costs
Discrete mathematics & theoretical computer science, Tome 13 (2011) no. 3 Cet article a éte moissonné depuis la source Episciences

Voir la notice de l'article

Analysis of Algorithms 
@article{DMTCS_2011_13_3_a8,
     author = {Prodinger, Helmut},
     title = {Digital search trees with m trees: {Level} polynomials and insertion costs},
     journal = {Discrete mathematics & theoretical computer science},
     year = {2011},
     volume = {13},
     number = {3},
     doi = {10.46298/dmtcs.557},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.557/}
}
TY  - JOUR
AU  - Prodinger, Helmut
TI  - Digital search trees with m trees: Level polynomials and insertion costs
JO  - Discrete mathematics & theoretical computer science
PY  - 2011
VL  - 13
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.557/
DO  - 10.46298/dmtcs.557
LA  - en
ID  - DMTCS_2011_13_3_a8
ER  - 
%0 Journal Article
%A Prodinger, Helmut
%T Digital search trees with m trees: Level polynomials and insertion costs
%J Discrete mathematics & theoretical computer science
%D 2011
%V 13
%N 3
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.557/
%R 10.46298/dmtcs.557
%G en
%F DMTCS_2011_13_3_a8
Prodinger, Helmut. Digital search trees with m trees: Level polynomials and insertion costs. Discrete mathematics & theoretical computer science, Tome 13 (2011) no. 3. doi: 10.46298/dmtcs.557

Cité par Sources :