Geodesic
Partially persistent search trees with transcript operations
Discrete mathematics & theoretical computer science, Tome 3 (1998-1999) no. 3.

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

When dictionaries are persistent, it is natural to introduce a transcript operation which reports the status changes for a given key over time. We discuss when and how a time and space efficient implementation of this operation can be provided. 
@article{DMTCS_1999_3_3_a0,
     author = {Larsen, Kim S.},
     title = {Partially persistent search trees with transcript operations},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {3},
     number = {3},
     year = {1998-1999},
     doi = {10.46298/dmtcs.253},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.253/}
}
TY  - JOUR
AU  - Larsen, Kim S.
TI  - Partially persistent search trees with transcript operations
JO  - Discrete mathematics & theoretical computer science
PY  - 1998-1999
VL  - 3
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.253/
DO  - 10.46298/dmtcs.253
LA  - en
ID  - DMTCS_1999_3_3_a0
ER  - 
%0 Journal Article
%A Larsen, Kim S.
%T Partially persistent search trees with transcript operations
%J Discrete mathematics & theoretical computer science
%D 1998-1999
%V 3
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.253/
%R 10.46298/dmtcs.253
%G en
%F DMTCS_1999_3_3_a0
Larsen, Kim S. Partially persistent search trees with transcript operations. Discrete mathematics & theoretical computer science, Tome 3 (1998-1999) no. 3. doi : 10.46298/dmtcs.253. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.253/

Cité par Sources :