{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T20:02:47Z","timestamp":1708545767176},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,9]]},"DOI":"10.1016\/0196-6774(85)90003-3","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"336-350","source":"Crossref","is-referenced-by-count":31,"title":["The analysis of a fringe heuristic for binary search trees"],"prefix":"10.1016","volume":"6","author":[{"given":"Patricio V","family":"Poblete","sequence":"first","affiliation":[]},{"given":"J.Ian","family":"Munro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 2","key":"10.1016\/0196-6774(85)90003-3_BIB1_1","first-page":"263","article-title":"An algorithm for the organization of information","volume":"146","author":"Adel'son-Vel'skii","year":"1962","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0196-6774(85)90003-3_BIB1_2","first-page":"1259","volume":"3","year":"1962","journal-title":"Soviet Math. Dokl"},{"key":"10.1016\/0196-6774(85)90003-3_BIB2","article-title":"An Investigation into the Principles of the Classification and Analysis of Data on an Automatic Digital Computer","author":"Bell","year":"1965"},{"key":"10.1016\/0196-6774(85)90003-3_BIB3","series-title":"Proceedings of the 19th Found. Comput. Sci","article-title":"A Dichromatic Framework for Balanced Trees","author":"Guibas","year":"1978"},{"key":"10.1016\/0196-6774(85)90003-3_BIB4","article-title":"Modified Binary Search Trees","author":"Itai","year":"1980"},{"key":"10.1016\/0196-6774(85)90003-3_BIB5","volume":"Vol. 3","author":"Knuth","year":"1973"},{"issue":"No. 1","key":"10.1016\/0196-6774(85)90003-3_BIB6","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\/0196-6774(85)90003-3_BIB7","article-title":"Quicksort","author":"Sedgewick","year":"1975"},{"issue":"No. 4","key":"10.1016\/0196-6774(85)90003-3_BIB8","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1093\/comjnl\/19.4.322","article-title":"Locally balanced binary trees","volume":"19","author":"Walker","year":"1976","journal-title":"Comput. J"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900033?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900033?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:26:10Z","timestamp":1548743170000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["0196677485900033"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90003-3","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}