{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T21:55:29Z","timestamp":1777154129594,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540406747","type":"print"},{"value":"9783540451464","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45146-4_26","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T21:51:19Z","timestamp":1277243479000},"page":"445-462","source":"Crossref","is-referenced-by-count":11,"title":["Lower and Upper Bounds on Obtaining History Independence"],"prefix":"10.1007","author":[{"given":"Niv","family":"Buchbinder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erez","family":"Petrank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Andersson, A., Ottmann, T.: Faster Uniquely Represented Dictionaries. In: Proc. 32nd IEEE Sympos. Foundations of Computer Science, pp. 642\u2013649 (1991)","DOI":"10.1109\/SFCS.1991.185430"},{"key":"26_CR2","unstructured":"Buchbinder, N., Petrank, E.: Lower and Upper Bounds on Obtaining History Independence, http:\/\/www.cs.technion.ac.il\/~erez\/publications.html"},{"key":"26_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 6th edn. MIT Press and McGraw-Hill Book Company (1992)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Hong, E.S., Mohr, A.E., Pentney, W.R., Rocke, E.C.: Characterizing History independent Data Structures. ISAAC 2002 pp. 229\u2013240 (2002)","DOI":"10.1007\/3-540-36136-7_21"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. Journal of Computer and System Sciences\u00a038(1), 86\u2013124 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Floyd, R.W.: Algorithm 245 (TREESORT). Communications of the ACM\u00a07 (1964)","DOI":"10.1145\/355588.365103"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: Oblivious data structures: Applications to cryptography. In: Proc. 29th ACM Symp. on Theory of computing, pp. 456\u2013464 (1997)","DOI":"10.1145\/258533.258638"},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. Journal of the ACM\u00a043(3), 431\u2013473 (1996)","journal-title":"Journal of the ACM"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Naor, M., Teague, V.: Anti-persistence: History Independent Data Structures. In: Proc. 33rd ACM Symp. on Theory of Computing (2001)","DOI":"10.1145\/380752.380844"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232 (HEAPSORT). Communication of the ACM\u00a07, 347\u2013348 (1964)","journal-title":"Communication of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45146-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T00:20:45Z","timestamp":1635553245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45146-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406747","9783540451464"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45146-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}