{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:29Z","timestamp":1725536009720},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_10","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"110-118","source":"Crossref","is-referenced-by-count":2,"title":["A Distribution-Sensitive Dictionary with Low Space Overhead"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"John","family":"Howat","sequence":"additional","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"1259","volume":"3","author":"G.M. Adelson-Velskii","year":"1962","unstructured":"Adelson-Velskii, G.M., Landis, E.M.: An algorithm for the organization of information. Soviet Math. Doklady\u00a03, 1259\u20131263 (1962)","journal-title":"Soviet Math. Doklady"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2007.03.002","volume":"382","author":"M. Badoiu","year":"2007","unstructured":"Badoiu, 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":"10_CR3","unstructured":"Bose, P., Douieb, K., Langerman, S.: Dynamic optimality for skip lists and B-trees. In: SODA 2008: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1106\u20131114 (2008)"},{"key":"10_CR4","unstructured":"Franceschini, G., Grossi, R.: Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. In: SODA 2003: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 670\u2013678 (2003)"},{"key":"10_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":"10_CR6","doi-asserted-by":"crossref","unstructured":"Franceschini, G., Munro, J.I.: Implicit dictionaries with O(1) modifications per update and fast search. In: SODA 2006: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 404\u2013413 (2006)","DOI":"10.1145\/1109557.1109603"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: FOCS 1978: Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, pp. 8\u201321 (1978)","DOI":"10.1109\/SFCS.1978.3"},{"key":"10_CR8","unstructured":"Iacono, J.: Alternatives to splay trees with O(log n) worst-case access times. In: SODA 2001: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 516\u2013522 (2001)"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00453-004-1139-5","volume":"42","author":"J. Iacono","year":"2005","unstructured":"Iacono, J., Langerman, S.: Queaps. Algorithmica\u00a042(1), 49\u201356 (2005)","journal-title":"Algorithmica"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J. Munro Ian","year":"1986","unstructured":"Ian Munro, J.: An implicit data structure supporting insertion, deletion, and search in O(log2\n                n) time. J. Comput. Syst. Sci.\u00a033(1), 66\u201374 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10_CR11","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"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T01:15:56Z","timestamp":1552094156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}