Algorithmica

, Volume 42, Issue 1, pp 57–74 | Cite as

Characterizing History Independent Data Structures

Article

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.

Data structures History independence Markov chains Algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2005

Authors and Affiliations

  1. 1.Microsoft Research, 1065 La Avenida, Mountain View, CA 94043USA
  2. 2.Computing & Software Systems, University of Washington, 1900 Commerce St., Tacoma,WA 98402USA
  3. 3.Department of Computer Science, State University of New York, Stony Brook, NY 11794USA
  4. 4.Department of Computer Science, University of Washington, Seattle, WA 98195USA

Personalised recommendations