Using persistent data structures for adding range restrictions to searching problems
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 1, pp. 25-49
Voir la notice de l'article provenant de la source Numdam
@article{ITA_1994__28_1_25_0,
author = {Lenhof, Hans-Peter and Smid, Michiel},
title = {Using persistent data structures for adding range restrictions to searching problems},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {25--49},
publisher = {EDP-Sciences},
volume = {28},
number = {1},
year = {1994},
mrnumber = {1271125},
zbl = {0998.68520},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ITA_1994__28_1_25_0/}
}
TY - JOUR AU - Lenhof, Hans-Peter AU - Smid, Michiel TI - Using persistent data structures for adding range restrictions to searching problems JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1994 SP - 25 EP - 49 VL - 28 IS - 1 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_1994__28_1_25_0/ LA - en ID - ITA_1994__28_1_25_0 ER -
%0 Journal Article %A Lenhof, Hans-Peter %A Smid, Michiel %T Using persistent data structures for adding range restrictions to searching problems %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1994 %P 25-49 %V 28 %N 1 %I EDP-Sciences %U http://geodesic.mathdoc.fr/item/ITA_1994__28_1_25_0/ %G en %F ITA_1994__28_1_25_0
Lenhof, Hans-Peter; Smid, Michiel. Using persistent data structures for adding range restrictions to searching problems. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 1, pp. 25-49. http://geodesic.mathdoc.fr/item/ITA_1994__28_1_25_0/
