Geodesic
A new class of balanced search trees : half-balanced binary search tress
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 16 (1982) no. 1, pp. 51-71 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

@article{ITA_1982__16_1_51_0,
     author = {Olivi\'e, H. J.},
     title = {A new class of balanced search trees : half-balanced binary search tress},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {51--71},
     year = {1982},
     publisher = {EDP-Sciences},
     volume = {16},
     number = {1},
     mrnumber = {677655},
     zbl = {0489.68056},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1982__16_1_51_0/}
}
TY  - JOUR
AU  - Olivié, H. J.
TI  - A new class of balanced search trees : half-balanced binary search tress
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1982
SP  - 51
EP  - 71
VL  - 16
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1982__16_1_51_0/
LA  - en
ID  - ITA_1982__16_1_51_0
ER  - 
%0 Journal Article
%A Olivié, H. J.
%T A new class of balanced search trees : half-balanced binary search tress
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1982
%P 51-71
%V 16
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1982__16_1_51_0/
%G en
%F ITA_1982__16_1_51_0
Olivié, H. J. A new class of balanced search trees : half-balanced binary search tress. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 16 (1982) no. 1, pp. 51-71. http://geodesic.mathdoc.fr/item/ITA_1982__16_1_51_0/