{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:29:12Z","timestamp":1648970952812},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8659,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,11]]},"DOI":"10.1016\/0890-5401(89)90058-8","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"206-233","source":"Crossref","is-referenced-by-count":0,"title":["Maintaining multiple representations of dynamic data structures"],"prefix":"10.1016","volume":"83","author":[{"given":"Michiel H.M.","family":"Smid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark H.","family":"Overmars","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leen","family":"Torenvliet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"van Emde Boas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90058-8_BIB1","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","article-title":"Decomposable searching problems","volume":"8","author":"Bentley","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(89)90058-8_BIB2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","article-title":"Decomposable searching problems. I. Static to dynamic transformations","volume":"1","author":"Bentley","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0890-5401(89)90058-8_BIB3","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\/0890-5401(89)90058-8_BIB4","series-title":"Proceedings, 19th Annual IEEE Symposium on Foundations of Computer Science","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978"},{"key":"10.1016\/0890-5401(89)90058-8_BIB5","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(89)90058-8_BIB6","series-title":"Proceedings, 19th Annual IEEE Symposium on Foundations of Computer Science","first-page":"28","article-title":"A data structure for orthogonal range queries","author":"Lueker","year":"1978"},{"key":"10.1016\/0890-5401(89)90058-8_BIB7","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\/0890-5401(89)90058-8_BIB8","article-title":"A Study of Balanced Binary Trees and Balanced One-Two Trees","author":"Olivi\u00e9","year":"1980"},{"key":"10.1016\/0890-5401(89)90058-8_BIB9","series-title":"Proceedings, 5th GI-Conference","first-page":"98","article-title":"On \u03b1-balanced binary search trees","volume":"Vol. 104","author":"Olivi\u00e9","year":"1981"},{"key":"10.1016\/0890-5401(89)90058-8_BIB10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1051\/ita\/1982160100511","article-title":"A new class of balanced trees: Half balanced binary search trees","volume":"16","author":"Olivi\u00e9","year":"1982","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0890-5401(89)90058-8_BIB11","volume":"Vol. 156","author":"Overmans","year":"1983"},{"key":"10.1016\/0890-5401(89)90058-8_BIB12","series-title":"Proceedings, 5th Annual STACS","first-page":"38","article-title":"Maintaining range trees in secondary memory","volume":"Vol. 294","author":"Overmars","year":"1988"},{"key":"10.1016\/0890-5401(89)90058-8_BIB13","author":"Overmars","year":"1987"},{"key":"10.1016\/0890-5401(89)90058-8_BIB14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hulls of finite sets of points in two and three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0890-5401(89)90058-8_BIB15","first-page":"131","article-title":"Two models for the reconstruction problem for dynamic data structures","volume":"25","author":"Smid","year":"1989"},{"key":"10.1016\/0890-5401(89)90058-8_BIB16","first-page":"253","article-title":"Updating a balanced search tree in O(1) rotations","volume":"16","author":"Tarjan","year":"1983"},{"key":"10.1016\/0890-5401(89)90058-8_BIB17","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. Assoc. Comput. Mach."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900588?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900588?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:26:29Z","timestamp":1549045589000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900588"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["0890540189900588"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90058-8","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,11]]}}}