{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T18:11:45Z","timestamp":1672337505092},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf01994883","type":"journal-article","created":{"date-parts":[[2005,8,4]],"date-time":"2005-08-04T20:22:09Z","timestamp":1123186929000},"page":"297-315","source":"Crossref","is-referenced-by-count":1,"title":["Improved bounds for the expected behaviour of AVL trees"],"prefix":"10.1007","volume":"32","author":[{"given":"Ricardo","family":"Baeza-Yates","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaston H.","family":"Gonnet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nivio","family":"Ziviani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"BF01994883_CR1","first-page":"263","volume":"146","author":"G. M. Adel'son-Vel'skii","year":"1962","unstructured":"G. M. Adel'son-Vel'skii and E. M. Landis.An algorithm for the organization of information. Doklady Akademia Nauk SSSR, 146 (2): 263\u2013266, 1962. English translation in Soviet Math. Doklady 3, 1962, 1259\u20131263.","journal-title":"Doklady Akademia Nauk SSSR"},{"issue":"2","key":"BF01994883_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289075","volume":"9","author":"A. C.-C. Yao","year":"1978","unstructured":"A. C.-C. Yao.On random 2\u20133 trees. Acta Informatica, 9 (2): 159\u2013170, 1978.","journal-title":"Acta Informatica"},{"issue":"1","key":"BF01994883_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0208003","volume":"8","author":"M. R. Brown","year":"1979","unstructured":"M. R. Brown.A partial analysis of random height-balanced trees. SIAM J on Computing, 8 (1): 33\u201341, Feb 1979.","journal-title":"SIAM J on Computing"},{"key":"BF01994883_CR4","series-title":"Technical Report","volume-title":"A partial analysis of height-balanced trees","author":"K. Mehlhorn","year":"1979","unstructured":"K. Mehlhorn.A partial analysis of height-balanced trees. Technical Report A79\/13, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, West Germany, 1979."},{"key":"BF01994883_CR5","first-page":"395","volume":"9","author":"Th. Ottmann","year":"1976","unstructured":"Th. Ottmann and H. W. Six.Eine neue Klasse von ausgeglichenen Bin\u00e4rb\u00e4umen. Angewandte Informatik, 9: 395\u2013400, 1976.","journal-title":"Angewandte Informatik"},{"issue":"3","key":"BF01994883_CR6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1093\/comjnl\/23.3.248","volume":"23","author":"Thomas Ottmann","year":"1980","unstructured":"Thomas Ottmann and Derick Wood. 1\u20132brother trees or AVL trees revisited. Computer Journal, 23 (3): 248\u2013255, Aug 1980.","journal-title":"Computer Journal"},{"issue":"4","key":"BF01994883_CR7","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1137\/0211061","volume":"11","author":"Kurt Mehlhorn","year":"1982","unstructured":"Kurt Mehlhorn.A partial analysis of height-balanced trees under random insertions and deletions. SIAM J on Computing, 11 (4): 748\u2013760, Nov. 1982.","journal-title":"SIAM J on Computing"},{"issue":"1","key":"BF01994883_CR8","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0215002","volume":"15","author":"Kurt Mehlhorn","year":"1986","unstructured":"Kurt Mehlhorn and A. Tsakalidis.An amortized analysis of insertions into AVL-trees. SIAM J on Computing, 15 (1): 22\u201333, Feb 1986.","journal-title":"SIAM J on Computing"},{"issue":"1","key":"BF01994883_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(82)90534-4","volume":"55","author":"B. Eisenbarth","year":"1982","unstructured":"B. Eisenbarth, N. Ziviani, Gaston H. Gonnet, Kurt Mehlhorn and Derick Wood.The theory of fringe analysis and its application to 2\u20133 trees and B-trees. Information and Control, 55 (1): 125\u2013174, Oct 1982.","journal-title":"Information and Control"},{"key":"BF01994883_CR10","unstructured":"N. Ziviani.The Fringe Analysis of Search Trees. PhD thesis, Department of Computer Science, University of Waterloo, 1982."},{"key":"BF01994883_CR11","unstructured":"R. A. Baeza-Yates and G. H. Gonnet.Average case analysis of algorithms using matrix recurrences. In 2nd International Conference on Computing and Information, ICCI'90, pages 47\u201351, Niagara Falls, Canada, May 1990. Also as Technical Report CS-89-16, Dept. of Computer Science, U. of Waterloo, 1989."},{"key":"BF01994883_CR12","volume-title":"The Art of Computer Programing: Sorting and Searching, volume 3","author":"D.-E. Knuth","year":"1973","unstructured":"D.-E. Knuth.The Art of Computer Programing: Sorting and Searching, volume 3. Addison-Wesley, Reading, Mass., 1973."},{"key":"BF01994883_CR13","volume-title":"The Art of Computer Programming: Fundamental Algorithms, volume 1","author":"D. E. Knuth","year":"1969","unstructured":"D. E. Knuth.The Art of Computer Programming: Fundamental Algorithms, volume 1. Addison-Wesley, Reading, Mass., 1969."},{"issue":"2","key":"BF01994883_CR14","first-page":"65","volume":"20","author":"N. Ziviani","year":"1982","unstructured":"N. Ziviani and F. W. Tompa.A look at symmetric binary B-trees. Infor, 20 (2): 65\u201381, May 1982.","journal-title":"Infor"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01994883.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01994883\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01994883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T21:56:31Z","timestamp":1557784591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01994883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF01994883"],"URL":"https:\/\/doi.org\/10.1007\/bf01994883","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}