Partially Persistent Binary Search Trees with Transcript Operations

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review


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.
BogserieD I M A C S Series in Discrete Mathematics and Theoretical Computer Science
Udgave nummer3
Sider (fra-til)95-107
Antal sider13
StatusUdgivet - 1999

Fingeraftryk Dyk ned i forskningsemnerne om 'Partially Persistent Binary Search Trees with Transcript Operations'. Sammen danner de et unikt fingeraftryk.

  • Citationsformater