{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:37Z","timestamp":1725571297958},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_4","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:09:23Z","timestamp":1291406963000},"page":"37-48","source":"Crossref","is-referenced-by-count":1,"title":["A Cache-Oblivious Implicit Dictionary with the Working Set Property"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Casper","family":"Kejlberg-Rasmussen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob","family":"Truelsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2007.03.002","volume":"382","author":"M. B\u01cedoiu","year":"2007","unstructured":"B\u01cedoiu, M., Cole, R., Demaine, E.D., Iacono, J.: A unified access bound on comparison-based dynamic dictionaries. Theoretical Computer Science\u00a0382(2), 86\u201396 (2007)","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","first-page":"1106","volume-title":"SODA 2008","author":"P. Bose","year":"2008","unstructured":"Bose, P., Dou\u00efeb, K., Langerman, S.: Dynamic optimality for skip lists and B-trees. In: SODA 2008, pp. 1106\u20131114. SIAM, Philadelphia (2008)"},{"key":"4_CR3","series-title":"LNCS","first-page":"110","volume-title":"WADS 2009","author":"P. Bose","year":"2009","unstructured":"Bose, P., Howat, J., Morin, P.: A distribution-sensitive dictionary with low space overhead. In: Dehne, F., et al. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 110\u2013118. Springer, Heidelberg (2009)"},{"key":"4_CR4","first-page":"80","volume-title":"SoCG 2009","author":"T.M.Y. Chan","year":"2009","unstructured":"Chan, T.M.Y., Chen, E.Y.: Optimal in-place algorithms for 3-d convex hulls and 2-d segment intersection. In: SoCG 2009, pp. 80\u201387. ACM, New York (2009)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-45078-8_11","volume-title":"Algorithms and Data Structures","author":"G. Franceschini","year":"2003","unstructured":"Franceschini, G., Grossi, R.: Optimal worst-case operations for implicit cache-oblivious search trees. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 114\u2013126. Springer, Heidelberg (2003)"},{"key":"4_CR6","first-page":"285","volume-title":"FOCS 1999","author":"M. Frigo","year":"1999","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: FOCS 1999, pp. 285\u2013297. IEEE, Los Alamitos (1999)"},{"key":"4_CR7","first-page":"516","volume-title":"SODA 2001","author":"J. Iacono","year":"2001","unstructured":"Iacono, J.: Alternatives to splay trees with $\\mathcal{O}$ (log(n)) worst-case access times. In: SODA 2001, pp. 516\u2013522. SIAM, Philadelphia (2001)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11534273_6","volume-title":"Algorithms and Data Structures","author":"C.W. Mortensen","year":"2005","unstructured":"Mortensen, C.W., Pettie, S.: The complexity of implicit and space-efficient priority queues. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 49\u201360. Springer, Heidelberg (2005)"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0022-0000(80)90037-9","volume":"21","author":"J.I. Munro","year":"1980","unstructured":"Munro, J.I., Suwanda, H.: Implicit data structures for fast search and update. Journal of Computer and System Sciences\u00a021(2), 236\u2013250 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"issue":"6","key":"4_CR11","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. Communications of the ACM\u00a07(6), 347\u2013348 (1964)","journal-title":"Communications 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\/978-3-642-17514-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,14]],"date-time":"2021-11-14T16:32:15Z","timestamp":1636907535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}