Partially persistent search trees with transcript operationsReport as inadecuate




Partially persistent search trees with transcript operations - Download this document for free, or read online. Document in PDF available to download.

1 IMADA - Department of Mathematics and Computer Science Odense

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.

Keywords : Complexity Data structures Search trees Persistence Complexity.





Author: Kim S. Larsen -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents