Skip to main content
Conference Proceedings

Partially persistent search trees with transcript operations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1373 LNCS 309-319
DOI: 10.1007/BFb0028570
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 1998 Springer-Verlag.

Cite

CITATION STYLE

APA

Larsen, K. S. (1998). Partially persistent search trees with transcript operations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1373 LNCS, pp. 309–319). https://doi.org/10.1007/BFb0028570

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free