{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T09:00:46Z","timestamp":1695632446601},"reference-count":10,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1982]]},"DOI":"10.1051\/ita\/1982160100511","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:41:21Z","timestamp":1486395681000},"page":"51-71","source":"Crossref","is-referenced-by-count":23,"title":["A new class of balanced search trees : half-balanced binary search tress"],"prefix":"10.1051","volume":"16","author":[{"given":"H. J.","family":"Olivi\u00e9","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. ADELSON-VELSKII G. M. and LANDIS E. M., An Algorithm for the Organization of Information, Dokl. Akad. Nauk S.S.S.R., Vol. 146, 1962, pp. 263-266 (Russian). English translation in Soviet Math. Dokl., Vol. 3, 1962, pp. 1259-1263.156719"},{"key":"R2","unstructured":"2. AHO A. V., HOPCROFT J. E. and ULLMAN J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.4135920326.68005"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. BAYER R., Symmetric Binary B-trees Data Structure and Maintenance Algorithms, Acta Informatica, Vol. 1, 1972, pp. 290-306.3231920233.68009","DOI":"10.1007\/BF00289509"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. BLUM N. and MEHLHORM K., Mittlere Anzahl von Rebalancierungoperationen in Gewichtsbalancierten B\u00e4umen, 4th GI Conference on Theoretical Computer Science, Aachen 1979, Lecture Notes in Computer Science, Vol. 67, pp. 67-78, Springer, Berlin, Heidelberg, New York.5680930399.05022","DOI":"10.1007\/3-540-09118-1_9"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. KARLTON P. L., FULLER S. H., SCROGGS R. E. and KAEHLER E. B., Performance of Height-Balanced Trees, Com. A.C.M. 19, Vol. 1, 1976, pp. 23-28.0317.68044","DOI":"10.1145\/359970.359989"},{"key":"R6","unstructured":"6. KNUTH D. E., The Art of Computer Programming, Vol. 1, Fundamental Algorithms, Addison-Wesley, Reading, Mass., 1968, 1973.0191.17903378456"},{"key":"R7","unstructured":"7. KNUTH D. E., The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, Reading, Mass., 1973.4459480302.68010"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. NIEVERGELT J. and Reingold E. M., Binary Search Trees of Bounded Balance, S.I.A.M. J. Comput., Vol. 2, 1973, pp. 33-43.3319030262.68012","DOI":"10.1137\/0202005"},{"key":"R9","unstructured":"9. OLIVI\u00c9 H. J., A New Class of Balanced Search Trees: Half-Balanced Binary Searc Trees, Technical Report 80-02, IHAM, Paardenmarkt 94, B-2000 Antwerp, Belgium, 1980.0489.68056"},{"key":"R10","unstructured":"10. OLIVI\u00c9 H. J., A Study of Balanced Binary Trees and Balanced One-Two Trees, Ph. D. Thesis, Dept. of Mathematics, U.I.A., University of Antwerp, Belgium, 1980.0422.68029"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1982160100511\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:35:23Z","timestamp":1568799323000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1982160100511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":10,"journal-issue":{"issue":"1"},"alternative-id":["ita1982160100511"],"URL":"http:\/\/dx.doi.org\/10.1051\/ita\/1982160100511","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1982]]}}}
