Partially persistent search trees with transcript operations

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

Partially persistent search trees with transcript operations

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

Partially Persistent Search Trees with Transcript Operations

this paper appeared in the proceedings of the 15th Symposium on Theoretical Aspects of Computer Science 1998 (STACS'98), Lecture Notes in Computer Science, Vol. 1373, pages 309-319, Springer-Verlag, 1998