Characterizing history independent data structures

DOI10.1007/S00453-004-1140-ZMaRDI QIDQ1777279zbMATH OpenOpenAlexFDO

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

Publication date 13 May 2005

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-004-1140-z

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1979502
• Lower and upper bounds on obtaining history independence
• Advances in Cryptology - CRYPTO 2003
• Anti-persistence
• History-Independent Cuckoo Hashing

Cited in

(9)

• Advances in Cryptology - CRYPTO 2003
• scientific article; zbMATH DE number 6469156 (Why is no real title available?)
• Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
• Lower and upper bounds on obtaining history independence
• Anti-persistence
• Programming languages for interactive computing
• scientific article; zbMATH DE number 1823191 (Why is no real title available?)
• Uniquely Represented Data Structures for Computational Geometry
• scientific article; zbMATH DE number 1979502 (Why is no real title available?)

This page was built for publication: Characterizing history independent data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777279)