Characterizing history independent data structures

Algorithmica (New York)

Volumn 42, Issue 1, 2005, Pages 57-74

  Hartline, Jason D ^a   Hong, Edwin S ^b   Mohr, Alexander E ^c   Pentney, William R ^d   Rocke, Emily C ^d  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

^c Stony Brook University   (United States)

^d University of Washington   (United States)

Author keywords

Algorithms; Data structures; History independence; Markov chains

Indexed keywords

ALGORITHMS; DATA PROCESSING; DATA STORAGE EQUIPMENT; MARKOV PROCESSES; PROBABILITY;

ABSTRACT DATA STRUCTURES; HISTORY INDEPENDENCE; POINTER STRUCTURES; RETRIBUTION;

DATA STRUCTURES;

EID: 17444401270     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1140-z     Document Type: Article

References (5)

1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
2. D. Micciancio. Oblivious data structures: applications to cryptography. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 456-464, 1997.
3. M. Naor. and V. Teague. Anti-persistence: history independent data structures. In Proceedings of the 33rd Symposium on Theory of Computing, pages 492-501, May 2001.
4. L. Snyder. On uniquely represented data structures. In Proceedings of the 28th Symposium on Foundations of Computer Science, pages 142-146, 1977.
5. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22:215-225, 1975.