{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:55Z","timestamp":1750694695894},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_21","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T14:07:11Z","timestamp":1227622031000},"page":"229-240","source":"Crossref","is-referenced-by-count":9,"title":["Characterizing History Independent Data Structures"],"prefix":"10.1007","author":[{"given":"Jason D.","family":"Hartline","sequence":"first","affiliation":[]},{"given":"Edwin S.","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Alexander E.","family":"Mohr","sequence":"additional","affiliation":[]},{"given":"William R.","family":"Pentney","sequence":"additional","affiliation":[]},{"given":"Emily C.","family":"Rocke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"21_CR1","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"D. Micciancio. Oblivious data structures: Applications to cryptography. In Proc. of 29th ACM Symposium on Theory of Computing, pages 456\u2013464, 1997.","DOI":"10.1145\/258533.258638"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"M. Naor. and V. Teague. Anti-persistence: History Independent Data Structures. In Proc. of 33nd Symposium Theory of Computing, May 2001.","DOI":"10.1145\/380752.380844"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"L. Synder. On Uniquely Represented Data Structures. In Proc. of 28th Symposium on Foundations of Computer Science, 1977.","DOI":"10.1109\/SFCS.1977.22"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. E. Tarjan","year":"1975","unstructured":"Robert E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22:215\u2013225, 1975.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:28:43Z","timestamp":1557930523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}