Partially persistent search trees with transcript operations.
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (1999)
- Volume: 3, Issue: 3, page 95-107
- ISSN: 1365-8050
Access Full Article
top
How to cite
topLarsen, Kim S.. "Partially persistent search trees with transcript operations.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 3.3 (1999): 95-107. <http://eudml.org/doc/120587>.
@article{Larsen1999,
author = {Larsen, Kim S.},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {data structures; persistence; complexity},
language = {eng},
number = {3},
pages = {95-107},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Partially persistent search trees with transcript operations.},
url = {http://eudml.org/doc/120587},
volume = {3},
year = {1999},
}
TY - JOUR
AU - Larsen, Kim S.
TI - Partially persistent search trees with transcript operations.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 1999
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 3
IS - 3
SP - 95
EP - 107
LA - eng
KW - data structures; persistence; complexity
UR - http://eudml.org/doc/120587
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.