Partially persistent search trees with transcript operations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 1999

Partially persistent search trees with transcript operations

Abstract

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.
Fichier principal
Vignette du fichier
dm030302.pdf (71.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00958929 , version 1 (13-03-2014)

Identifiers

Cite

Kim S. Larsen. Partially persistent search trees with transcript operations. Discrete Mathematics and Theoretical Computer Science, 1999, Vol. 3 no. 3 (3), pp.95-107. ⟨10.46298/dmtcs.253⟩. ⟨hal-00958929⟩

Collections

TDS-MACS
39 View
821 Download

Altmetric

Share

Gmail Facebook X LinkedIn More