Geodesic
Skip trees, an alternative data structure to skip lists in a concurrent approach
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 3, pp. 251-269

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1997__31_3_251_0,
     author = {Messeguer, Xavier},
     title = {Skip trees, an alternative data structure to skip lists in a concurrent approach},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {251--269},
     publisher = {EDP-Sciences},
     volume = {31},
     number = {3},
     year = {1997},
     mrnumber = {1483259},
     zbl = {0889.68115},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1997__31_3_251_0/}
}
TY  - JOUR
AU  - Messeguer, Xavier
TI  - Skip trees, an alternative data structure to skip lists in a concurrent approach
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1997
SP  - 251
EP  - 269
VL  - 31
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1997__31_3_251_0/
LA  - en
ID  - ITA_1997__31_3_251_0
ER  - 
%0 Journal Article
%A Messeguer, Xavier
%T Skip trees, an alternative data structure to skip lists in a concurrent approach
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1997
%P 251-269
%V 31
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1997__31_3_251_0/
%G en
%F ITA_1997__31_3_251_0
Messeguer, Xavier. Skip trees, an alternative data structure to skip lists in a concurrent approach. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 3, pp. 251-269. http://geodesic.mathdoc.fr/item/ITA_1997__31_3_251_0/