{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:25:54Z","timestamp":1720625154638},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1016\/j.jda.2011.11.003","type":"journal-article","created":{"date-parts":[[2011,11,17]],"date-time":"2011-11-17T14:28:51Z","timestamp":1321540131000},"page":"140-145","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A distribution-sensitive dictionary with low space overhead"],"prefix":"10.1016","volume":"10","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"John","family":"Howat","sequence":"additional","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jda.2011.11.003_br0010","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"Adel\u02bcson-Vel\u02bcskii","year":"1962","journal-title":"Soviet Math. Dokl."},{"issue":"2","key":"10.1016\/j.jda.2011.11.003_br0020","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.tcs.2007.03.002","article-title":"A unified access bound on comparison-based dynamic dictionaries","volume":"382","author":"B\u0103doiu","year":"2007","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jda.2011.11.003_br0030","unstructured":"Prosenjit Bose, Karim Dou\u00efeb, Stefan Langerman, Dynamic optimality for skip lists and B-trees, in: SODA \u02bc08: Proceedings of the 19th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, 2008, pp. 1106\u20131114."},{"key":"10.1016\/j.jda.2011.11.003_br0040","series-title":"LATIN \u02bc10: Proceedings of the 9th Annual Latin American Theoretical Informatics Symposium","first-page":"686","article-title":"Layered working-set trees","volume":"vol. 6034","author":"Bose","year":"2010"},{"issue":"1","key":"10.1016\/j.jda.2011.11.003_br0050","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1186810.1186816","article-title":"A data structure for a sequence of string accesses in external memory","volume":"3","author":"Ciriani","year":"2007","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.jda.2011.11.003_br0060","unstructured":"Gianni Franceschini, Roberto Grossi, Implicit dictionaries supporting searches and amortized updates in O(lognloglogn) time, in: SODA \u02bc03: Proceedings of the 14th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, 2003, pp. 670\u2013678."},{"key":"10.1016\/j.jda.2011.11.003_br0070","doi-asserted-by":"crossref","unstructured":"Gianni Franceschini, Roberto Grossi, Optimal worst-case operations for implicit cache-oblivious search trees, in: WADS \u02bc03: Proceedings of the 30th International Workshop on Algorithms and Data Structures, 2003, pp. 114\u2013126.","DOI":"10.1007\/978-3-540-45078-8_11"},{"key":"10.1016\/j.jda.2011.11.003_br0080","doi-asserted-by":"crossref","unstructured":"Gianni Franceschini, J. Ian Munro, Implicit dictionaries with O(1) modifications per update and fast search, in: SODA \u02bc06: Proceedings of the 17th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, 2006, pp. 404\u2013413.","DOI":"10.1145\/1109557.1109603"},{"key":"10.1016\/j.jda.2011.11.003_br0090","doi-asserted-by":"crossref","unstructured":"Leonidas J. Guibas, Robert Sedgewick, A dichromatic framework for balanced trees, in: FOCS \u02bc78: Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, 1978, pp. 8\u201321.","DOI":"10.1109\/SFCS.1978.3"},{"issue":"1","key":"10.1016\/j.jda.2011.11.003_br0100","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s00453-004-1139-5","article-title":"Queaps","volume":"42","author":"Iacono","year":"2005","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.jda.2011.11.003_br0110","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","article-title":"An implicit data structure supporting insertion, deletion, and search in O(log2n) time","volume":"33","author":"Munro","year":"1986","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/j.jda.2011.11.003_br0120","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self-adjusting binary search trees","volume":"32","author":"Sleator","year":"1985","journal-title":"J. ACM"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157086671100102X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157086671100102X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T15:05:26Z","timestamp":1560956726000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157086671100102X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":12,"alternative-id":["S157086671100102X"],"URL":"https:\/\/doi.org\/10.1016\/j.jda.2011.11.003","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}