{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:36Z","timestamp":1725456036494},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019021X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0026093","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:47:21Z","timestamp":1132645641000},"page":"16-27","source":"Crossref","is-referenced-by-count":1,"title":["On the maximum path length of AVL trees"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Klein","sequence":"first","affiliation":[]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","first-page":"263","volume":"146","author":"G.M. Adel'son-Vel'skii","year":"1962","unstructured":"G.M. Adel'son-Vel'skii and Y.M. Landis. An algorithm for the organization of information. Doklady Akademi Nauk, 146:263\u2013266, 1962.","journal-title":"Doklady Akademi Nauk"},{"key":"2_CR2","unstructured":"A. Br\u00fcggemann-Klein and D. Wood. Drawing Trees Nicely with T EX. Technical Report CS-87-05, Department of Computer Science, University of Waterloo, 1987."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"C.C. Foster. Information storage and retrieval using AVL trees. In Proccedings of the ACM National Conference, pages 192\u2013205, 1965.","DOI":"10.1145\/800197.806043"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1145\/358476.358509","volume":"26","author":"G. Gonnet","year":"1983","unstructured":"G. Gonnet. Balancing binary trees by internal path reduction. Communications of the ACM, 26:1074\u20131081, 1983.","journal-title":"Communications of the ACM"},{"key":"2_CR5","unstructured":"R. Klein and D. Wood. On the Path Length of Binary Trees. Technical Report CS-87-06, Department of Computer Science, University of Waterloo, 1987."},{"key":"2_CR6","volume-title":"The Art of Computer Programming, Vol.3: Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth. The Art of Computer Programming, Vol.3: Sorting and Searching. Addison-Wesley Publishing Co., Reading, Mass., 1973."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/0213015","volume":"13","author":"T. Ottmann","year":"1984","unstructured":"Th. Ottmann, D.St. Parker, A.L. Rosenberg, H.-W. Six, and D. Wood. Minimal-cost brother trees. SIAM Journal on Computing, 13:197\u2013217, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"2_CR8","first-page":"395","volume":"9","author":"T. 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"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02252612","volume":"23","author":"T. Ottmann","year":"1979","unstructured":"Th. Ottmann, H.-W. Six, and D. Wood. On the correspondence between AVL trees and brother trees. Computing, 23:43\u201354, 1979.","journal-title":"Computing"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1093\/comjnl\/23.3.248","volume":"23","author":"T. Ottmann","year":"1981","unstructured":"Th. Ottmann and D. Wood. 1\u20132 brother trees or AVL trees revisited. Computer Journal, 23:248\u2013255, 1981.","journal-title":"Computer Journal"}],"container-title":["Lecture Notes in Computer Science","CAAP '88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026093.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:55:49Z","timestamp":1607550949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019021X"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0026093","relation":{},"subject":[]}}