Discrete Mathematics & Theoretical Computer Science
Volume 3 n° 3 (1999), pp. 95-107
| author: | Kim S. Larsen |
|---|---|
| title: | Partially persistent search trees with transcript operations |
| keywords: | Data structures, Search trees, Persistence, Complexity. |
| 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. |
| reference: | Kim S. Larsen (1999), Partially persistent search trees with transcript operations, Discrete Mathematics and Theoretical Computer Science 3, pp. 95-107 |
| ps.gz-source: | dm030302.ps.gz (34K) |
| ps-source: | dm030302.ps (113K) |
| pdf-source: | dm030302.pdf (60K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Automatically produced on Tue Jun 29 14:25:43 MEST 1999 by gustedt