Partially persistent search trees with transcript operations.
Larsen, Kim S.
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 3 (1999), p. 95-107 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Access to full text
Publié le : 1999-01-01
EUDML-ID : urn:eudml:doc:120587 
@article{01375590,
     title = {Partially persistent search trees with transcript operations.},
     journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
     volume = {3},
     year = {1999},
     pages = {95-107},
     zbl = {0947.68043},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01375590}
}

Larsen, Kim S. Partially persistent search trees with transcript operations.. Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 3 (1999) pp. 95-107. http://gdmltest.u-ga.fr/item/01375590/