Kim S. Larsen - Partially persistent search trees with transcript operations

dmtcs:253 - Discrete Mathematics & Theoretical Computer Science, January 1, 1999, vol. 3:3, Special Issue STACS'98 - https://doi.org/10.46298/dmtcs.253
Partially persistent search trees with transcript operationsArticle

Authors: Kim S. Larsen ORCID1

  • 1 Department of Mathematics and Computer Science [Odense]


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.

https://doi.org/10.46298/dmtcs.253
Source: HAL:hal-00958929v1
Volume: vol. 3:3, Special Issue STACS'98
Published on: January 1, 1999
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] Complexity, Data structures, Search trees, Persistence, Complexity.
Licence: Hal authorisation v1

Share and export

Consultation statistics

This page has been seen 636 times.
This article's PDF has been downloaded 477 times.