{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T01:52:47Z","timestamp":1775785967794,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/s0022-0000(05)80075-3","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T07:18:35Z","timestamp":1124522315000},"page":"667-682","source":"Crossref","is-referenced-by-count":27,"title":["Efficient rebalancing of chromatic search trees"],"prefix":"10.1016","volume":"49","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80075-3_bib1_1","first-page":"263","article-title":"An algorithm for the organisation of information","volume":"146","author":"Adel'son-Vel'ski\u012b","year":"1962","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0022-0000(05)80075-3_bib1_2","first-page":"1259","volume":"3","year":"1962","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0022-0000(05)80075-3_bib2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indexes","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/S0022-0000(05)80075-3_bib3","series-title":"Algorithm Theory\u2014SWAT '92","first-page":"151","article-title":"Efficient rebalancing of chromatic search trees","volume":"Vol. 621","author":"Boyar","year":"1992"},{"key":"10.1016\/S0022-0000(05)80075-3_bib4","series-title":"Proceedings, Nineteenth Annual Symposium on Foundations of Computer Science","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978"},{"key":"10.1016\/S0022-0000(05)80075-3_bib5","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1145\/182.358442","article-title":"On-the-fly optimization of data structures","volume":"26","author":"Kessels","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(05)80075-3_bib6_1","series-title":"Proceedings, Fourth International Conference on Very Large Data Bases","first-page":"498","article-title":"A concurrent database manipulation problem: Binary search trees","author":"Kung","year":"1978"},{"key":"10.1016\/S0022-0000(05)80075-3_bib6_2","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1145\/320613.320619","volume":"5","year":"1980","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0022-0000(05)80075-3_bib7","article-title":"An Efficient Algorithm for Balancing Binary Search Trees","author":"Malmi","year":"1992"},{"key":"10.1016\/S0022-0000(05)80075-3_bib8","series-title":"Proceedings, Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"192","article-title":"Uncoupling updating and rebalancing in chromatic binary search trees","author":"Nurmi","year":"1991"},{"key":"10.1016\/S0022-0000(05)80075-3_bib9","series-title":"Proceedings, Sixth ACM-SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"170","article-title":"Concurrency control in database structures with relaxed balance","author":"Nurmi","year":"1987"},{"key":"10.1016\/S0022-0000(05)80075-3_bib10","series-title":"Algorithms and Data Structures, Proceedings WADS '89","first-page":"437","article-title":"Skip lists: A probabilistic alternative to balanced trees","volume":"Vol. 382","author":"Pugh","year":"1989"},{"key":"10.1016\/S0022-0000(05)80075-3_bib11","article-title":"Concurrent Maintenance of Skip Lists","author":"Pugh","year":"1989"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800753?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800753?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T17:27:02Z","timestamp":1548178022000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["S0022000005800753"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80075-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}