Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2002: Algorithms and Computation pp 229–240Cite as

Characterizing History Independent Data Structures

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2518))

Abstract

We consider history independent data structures as proposed for study by Teague and Naor [3]. In a history independent data structure, nothing can be learned from the 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 also provide a natural less restrictive definition of strong history independence 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.

The full version of this extended abstract is available from: http://www.cs.washington.edu/research/computation/theory-night /papers/hist-indep.ps

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.

    Google Scholar 

  2. D. Micciancio. Oblivious data structures: Applications to cryptography. In Proc. of 29th ACM Symposium on Theory of Computing, pages 456–464, 1997.

    Google Scholar 

  3. M. Naor. and V. Teague. Anti-persistence: History Independent Data Structures. In Proc. of 33nd Symposium Theory of Computing, May 2001.

    Google Scholar 

  4. L. Synder. On Uniquely Represented Data Structures. In Proc. of 28th Symposium on Foundations of Computer Science, 1977.

    Google Scholar 

  5. Robert E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22:215–225, 1975.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Washington, Seattle, WA, 98195

    Jason D. Hartline, Edwin S. Hong, Alexander E. Mohr, William R. Pentney & Emily C. Rocke

Authors
  1. Jason D. Hartline
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edwin S. Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexander E. Mohr
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. William R. Pentney
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Emily C. Rocke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Prosenjit Bose  & Pat Morin  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hartline, J.D., Hong, E.S., Mohr, A.E., Pentney, W.R., Rocke, E.C. (2002). Characterizing History Independent Data Structures. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

  • Online ISBN: 978-3-540-36136-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation