{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:36Z","timestamp":1725455856429},"publisher-location":"Berlin\/Heidelberg","reference-count":5,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010576X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017302","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:22:34Z","timestamp":1132644154000},"page":"98-108","source":"Crossref","is-referenced-by-count":0,"title":["On \u03b1-balanced binary search trees"],"prefix":"10.1007","author":[{"given":"Henk J.","family":"Olivi\u00e9","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., Symmetric binary B-trees: data structure and maintenance algorithms, Acta Informatica 1(1972), 290\u2013306.","journal-title":"Acta Informatica"},{"key":"14_CR2","volume-title":"The art of computer programming, Vol. 3: Sorting and searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E., The art of computer programming, Vol. 3: Sorting and searching, Addison-Wesley, Reading, Mass., 1973."},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J. Nievergelt","year":"1973","unstructured":"Nievergelt, J. and Reingold, E.M., Binary search trees of bounded balance, SIAM J. Comput. 2, 1(March 1973), 33\u201343.","journal-title":"SIAM J. Comput."},{"key":"14_CR4","unstructured":"Olivi\u00e9, H., A new class of balanced search trees: half-balanced binary search trees, Technical Report 80-02, Interstedelijke Industriele Hogeschool Antwerpen-Mechelen, Antwerp, June 1980, to appear in RAIRO-Informatique Th\u00e9orique."},{"key":"14_CR5","unstructured":"Olivi\u00e9, H., A study of balanced binary trees and balanced one-two trees, Ph.D. thesis, Department of Mathematics, U.I.A., University of Antwerp, 1980."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017302.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:38:08Z","timestamp":1607549888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0017302","relation":{},"subject":[]}}