{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:33Z","timestamp":1761611073156},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0020-0190(90)90171-s","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"37-40","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic deferred data structuring"],"prefix":"10.1016","volume":"35","author":[{"given":"Yu-Tai","family":"Ching","sequence":"first","affiliation":[]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[]},{"given":"Michiel H.M.","family":"Smid","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90171-S_BIB1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(80)90018-3","article-title":"On the average number of rebalancing operations in weight-balanced trees","volume":"11","author":"Blum","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(90)90171-S_BIB2","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1137\/0217055","article-title":"Deferred data structuring","volume":"17","author":"Karp","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(90)90171-S_BIB3","article-title":"Sorting and Searching","volume":"Vol. 1","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0020-0190(90)90171-S_BIB4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","article-title":"Binary search trees of bounded balance","volume":"2","author":"Nievergelt","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(90)90171-S_BIB5","article-title":"The Design of Dynamic Data Structures","volume":"156","author":"Overmars","year":"1983"},{"key":"10.1016\/0020-0190(90)90171-S_BIB6","series-title":"ITLI Prepublication Series CT-89-01","article-title":"Dynamic deferred data structures","author":"Smid","year":"1989"},{"key":"10.1016\/0020-0190(90)90171-S_BIB7","series-title":"Ph.D. Thesis","article-title":"Dynamic data structures on multiple storage media","author":"Smid","year":"1989"},{"key":"10.1016\/0020-0190(90)90171-S_BIB8","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","article-title":"Adding range restriction capability to dynamic data structures","volume":"32","author":"Willard","year":"1985","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090171S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090171S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:20:13Z","timestamp":1555089613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090171S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["002001909090171S"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90171-s","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}