Abstract
We consider history independent data structures as proposed for study by Naor and Teague. In a history independent data structure, nothing can be learned from the memory representation of the data structure except for what is available from the abstract data structure. We show that for the most part, strong history independent data structures have canonical representations. We provide a natural alternative definition of strong history independence that is less restrictive than Naor and Teague and characterize how it restricts allowable representations. We also give a general formula for creating dynamically resizing history independent data structures and give a related impossibility result.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Hartline, J., Hong, E., Mohr, A. et al. Characterizing History Independent Data Structures. Algorithmica 42, 57–74 (2005). https://doi.org/10.1007/s00453-004-1140-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-004-1140-z