{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:39Z","timestamp":1725663279671},"publisher-location":"Berlin, Heidelberg","reference-count":88,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540102915"},{"type":"electronic","value":"9783540384359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10291-4_16","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:09:08Z","timestamp":1330189748000},"page":"234-249","source":"Crossref","is-referenced-by-count":1,"title":["The analysis of search trees: A survey"],"prefix":"10.1007","author":[{"given":"Th.","family":"Ottmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. -W.","family":"Six","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Altenkamp,D., and Mehlhorn,K.: Codes: unequal probabilities, unequal letter costs. Universitaet des Saarlandes Computer Science Technical Report A77\/13 (1977)","DOI":"10.1007\/3-540-08860-1_2"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/322092.322094","volume":"25","author":"B. Allen","year":"1978","unstructured":"Allen, B., and Munro, J.I.: Self-organizing binary search trees. J. ACM 25 (1978), 526\u2013535","journal-title":"J. ACM"},{"key":"16_CR3","first-page":"467","volume":"44","author":"J. L. Baer","year":"1975","unstructured":"Baer, J.L.: Weight-balanced trees. Proc. AFIPS National Computer Conference 44 (1975), 467\u2013472","journal-title":"Proc. AFIPS National Computer Conference"},{"key":"16_CR4","unstructured":"Bayer,P.J.: Improved bounds on the costs of optimal and balanced binary search trees. MIT Project MAC Technical Memo. 69 (1975)"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/0208007","volume":"8","author":"J. R. Bitner","year":"1979","unstructured":"Bitner, J.R.: Heuristics that dynamically organize data structures. SIAM J. Comput. 8 (1979), 82\u2013110","journal-title":"SIAM J. Comput."},{"key":"16_CR6","unstructured":"Bitner,J.R., and Huang,S.H.: Key comparison optimal 2\u20133 trees with maximum utilization. University of Texas Computer Science Technical Report No.94 (1979)"},{"key":"16_CR7","unstructured":"Blum,N., and Mehlhorn,K.: On the average number of rebalancing operations in weight-balanced trees. Universitaet des Saarlandes, Computer Science Technical Report A-78\/06 (1978)"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1137\/0208042","volume":"8","author":"A. Bagchi","year":"1979","unstructured":"Bagchi, A., and Roy, J.K.: On V-optimal trees. SIAM J. Comput.8, (1979), 524\u2013541","journal-title":"SIAM J. Comput."},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0207026","volume":"7","author":"M. R. Brown","year":"1978","unstructured":"Brown, M.R.: Implementation and analysis of binomial queue algorithms. SIAM J. Comput. 7 (1978), 298\u2013319","journal-title":"SIAM J. Comput."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0208003","volume":"8","author":"M. R. Brown","year":"1979","unstructured":"Brown, M.R.: A partial analysis of random height-balanced trees. SIAM J. Comput. 8 (1979), 33\u201341","journal-title":"SIAM J. Comput."},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(79)90127-3","volume":"9","author":"M. R. Brown","year":"1979","unstructured":"Brown, M.R.: Some observations on random 2\u20133 trees. Information Processing Letters 9 (1979), 57\u201359","journal-title":"Information Processing Letters"},{"key":"16_CR12","unstructured":"Brown,M.R., and Tarjan,R.E.: Design and analysis of a data structure for representing sorted lists. Stanford University, Computer Science Technical Report (1978)"},{"key":"16_CR13","unstructured":"Bruno,J., and Coffman,E.G.: Nearly optimal binary search trees. IFIP 1971, North-Holland (1972), 99\u2013103"},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00264321","volume":"10","author":"D. M. Choy","year":"1978","unstructured":"Choy, D.M., and Wong, C.K.: Optimal trees with capacity constraint, Acta Informatica 10, (1978), 273\u2013296","journal-title":"Acta Informatica"},{"key":"16_CR15","unstructured":"Cot,N.: Characterization and design of optimal prefix codes. Doctoral Dissertation, Stanford University (1977)"},{"key":"16_CR16","unstructured":"Culik II,K., Ottmann,Th., and Wood,D.: Dense multiway trees. University of Karlsruhe, Technical Report No. 77, Inst. f. Ang. Inf. u. Form. Beschr.verf. (1978)"},{"key":"16_CR17","unstructured":"van Doren,J.R.: An asymptotic analysis of minimum order B-trees. Unpublished manuscript, (1976)"},{"key":"16_CR18","unstructured":"Fairley,R.: Unpublished manuscript, (1973)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Flajolet,P., Francon,J., and Vuillemin,J.: Sequence of operations analysis for dynamic data structures. Journal of Algorithms 1 (1980). to appear","DOI":"10.1016\/0196-6774(80)90020-6"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Flajolet,P., and Odlyzko,A.: The average height of binary trees and other simple trees. Unpublished manuscript (1980)","DOI":"10.1109\/SFCS.1980.19"},{"key":"16_CR21","unstructured":"Flajolet,P., Ottmann,Th., and Wood,D.: Search trees, free search trees and bubble memories. In preparation (1980)"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Fredman,M.L.: Two applications of a probabilistic search technique: sorting X+Y and building balanced search trees. Proc. 17th Ann. ACM Symposium on Theory of Computing (1975), 240\u2013244","DOI":"10.1145\/800116.803774"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Flajolet,P., and Steyaert,J.M.: On the analysis of tree-matching algorithms. Seventh ICALP 80, (J.W. de Bakker and J. van Leeuwen, ed.), Lecture Notes in Computer Science, Vol.85 (1980), 208\u2013219","DOI":"10.1007\/3-540-10003-2_72"},{"key":"16_CR24","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/0203008","volume":"2","author":"M. R. Garey","year":"1974","unstructured":"Garey, M.R.: Optimal binary search trees with restricted maximal depth. SIAM J. Comput. 2 (1974), 101\u2013110","journal-title":"SIAM J. Comput."},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Guettler,R., Mehlhorn,K., Schneider,W., and Wernet,N.: Binary search trees: average and worst case behavior. Universitaet des Saarlandes, Computer Science Technical Report A-76\/2 (1976)","DOI":"10.1007\/978-3-642-95289-0_22"},{"key":"16_CR26","unstructured":"Gotlieb,L.: Optimal muliway search trees. Doctoral Dissertation, University of Toronto (1978)"},{"key":"16_CR27","unstructured":"Gotlieb,L., Kriegel,H.P., Vaishnavi,V.K., and Wood,D.: Optimal multiway search trees. Proc. of the 1979 Johns Hopkins Conference on Information Sciences and Systems (1979), 255\u2013256"},{"key":"16_CR28","unstructured":"Gotlieb,C.C., and Walker,W.A.: A top-down algorithm for constructing nearly optimal lexicographical trees. Graph Theory and Computing (ed. Read,R.C.), Academic Press (1972)"},{"key":"16_CR29","unstructured":"Gotlieb,L., and Wood,D.: The construction of optimal multiway search trees and the monotonicity principle. Int. J. of Comp. Math. (1980), to appear"},{"key":"16_CR30","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/0135034","volume":"35","author":"L. J. Guibas","year":"1978","unstructured":"Guibas, L.J., and Odlyzko, A.M.: Maximal prefix-synchronized codes. SIAM J. Appl. Math. 35 (1978), 401\u2013418","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"16_CR31","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1137\/0206045","volume":"6","author":"A. M. Garsia","year":"1977","unstructured":"Garsia, A.M., and Wachs, M.L.: A new algorithm for minimum cost binary trees. SIAM J. Comput. 6,4 (1977), 622\u2013642","journal-title":"SIAM J. Comput."},{"key":"16_CR32","unstructured":"Halton,J.H.: Statistics of trees. University of Wisconsin-Madison, Computer Science Technical Report 334 (1978)"},{"key":"16_CR33","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/S0019-9958(77)80011-9","volume":"34","author":"Y. Horibe","year":"1977","unstructured":"Horibe, Y.: An improved bound for weight-balanced tree. Information and Control 34 (1977), 148\u2013151","journal-title":"Information and Control"},{"key":"16_CR34","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00264017","volume":"12","author":"Y. Horibe","year":"1979","unstructured":"Horibe, Y., and Nemetz, T.O.H.: On the max-entropy rule for a binary search tree. Acta Informatica 12 (1979), 63\u201372","journal-title":"Acta Informatica"},{"key":"16_CR35","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(76)90064-5","volume":"3","author":"G. Hotz","year":"1977","unstructured":"Hotz, G.: Schranken fuer balanced trees bei ausgewogenen Verteilungen. Theoretical Computer Science 3 (1977),51\u201359","journal-title":"Theoretical Computer Science"},{"key":"16_CR36","unstructured":"Huang,S.H.S.: Key comparison optimal 2\u20133-trees with maximum utilization. Master's dissertation, The University of Texas at Austin (1979)"},{"key":"16_CR37","unstructured":"Huang,S.H.S.: Space and comparison optimal 1\u20132 brother trees. The University of Texas at Austin, Computer Science Technical Report 386 (1977)"},{"key":"16_CR38","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1137\/0137015","volume":"37","author":"T. C. Hu","year":"1979","unstructured":"Hu, T.C., Kleitman, D.J., and Tamaki, J.K.: Binary trees optimum under various criteria. SIAM J. Appl. Math. 37 (1979), 246\u2013256","journal-title":"SIAM J. Appl. Math."},{"key":"16_CR39","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0121057","volume":"21","author":"T. C. Hu","year":"1971","unstructured":"Hu, T.C., and Tucker, A.C.: Optimal computer search trees and variable length alphabetic codes. SIAM J. Appl. Math. 21 (1971),514\u2013532","journal-title":"SIAM J. Appl. Math."},{"key":"16_CR40","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1137\/0205002","volume":"5","author":"A. Itai","year":"1976","unstructured":"Itai, A.: Optimum alphabetic trees. SIAM J. Comput. 5 (1976), 9\u201318","journal-title":"SIAM J. Comput."},{"key":"16_CR41","unstructured":"Knott,G.D.: Deletion in binary storage trees. Stanford University Computer Science Technical Report CS-75-491 (1975)"},{"key":"16_CR42","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/359970.359989","volume":"19","author":"P. L. Karlton","year":"1976","unstructured":"Karlton, P.L., Fuller, S.H., Scroggs, R.E., and Kaehler, E.B.: Performance of height-balanced trees. Commun. ACM 19 (1976), 23\u201328","journal-title":"Commun. ACM"},{"key":"16_CR43","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D. E. Knuth","year":"1971","unstructured":"Knuth, D.E.: Optimum binary search trees. Acta Informatica 1 (1971), 14\u201325","journal-title":"Acta Informatica"},{"key":"16_CR44","volume-title":"The art of computer programming \u2014 Volume 3: Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming \u2014 Volume 3: Sorting and Searching. Reading, Mass., Addison-Wesley (1973)"},{"key":"16_CR45","doi-asserted-by":"crossref","unstructured":"Koesler,P., and Ottmann,Th.: An experimental study of insertion schemes for classes of multiway search trees. Int. J. Comp. Math. (1980), to appear","DOI":"10.1080\/00207168108803242"},{"key":"16_CR46","unstructured":"van Leeuwen,J.: On the construction of Huffman trees. Third ICALP (eds. Michaelson and Milner), Edinburgh University Press (1976), 382\u2013410"},{"key":"16_CR47","unstructured":"Larson,J.A., and Walden,W.E.: Comparing insertion schemes used to update 2\u20133-trees. Unpublished manuscript"},{"key":"16_CR48","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00264563","volume":"5","author":"K. Mehlhorn","year":"1975","unstructured":"Mehlhorn, K.: Nearly optimal binary search trees. Acta Informatica 5 (1975), 287\u2013295","journal-title":"Acta Informatica"},{"key":"16_CR49","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/0206017","volume":"6","author":"K. Mehlhorn","year":"1977","unstructured":"Mehlhorn, K.: A best possible bound for the weighted path length of binary search trees. SIAM J. Comput. 6 (1977) 235\u2013239","journal-title":"SIAM J. Comput."},{"key":"16_CR50","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1137\/0208014","volume":"8","author":"K. Mehlhorn","year":"1979","unstructured":"Mehlhorn, K.: Dynamic binary search. SIAM J. Comput. 8 (1979), 175\u2013198","journal-title":"SIAM J. Comput."},{"key":"16_CR51","unstructured":"Mehlhorn, K.: An efficient algorithm for constructing nearly optimal prefix codes. Universitaet des Saarlandes Computer Science Technical Report A-78\/13 (1978)"},{"key":"16_CR52","doi-asserted-by":"crossref","unstructured":"Mehlhorn,K.: Searching, sorting and information theory. Math. Found. of Comp. Sci., Proc., (ed. J.Becvar), (1979), 131\u2013145","DOI":"10.1007\/3-540-09526-8_10"},{"key":"16_CR53","unstructured":"Mehlhorn,K.: A partial analysis of height balanced trees. Universitaet des Saarlandes, Computer Science Technical Report A-79\/13 (1979)"},{"key":"16_CR54","unstructured":"Mehlhorn,K.: A new data structure for representing sorted lists. Universitaet des Saarlandes, Computer Science Technical Report A-79\/22 (1979)"},{"key":"16_CR55","unstructured":"Mehlhorn,K.: Dynamic data structures. Mathematical Centre Tracts 108 Foundations of Computer Science III, (J.W. de Bakker and J. van Leeuwen, ed.) Amsterdam (1979), 71\u201396"},{"key":"16_CR56","unstructured":"Maruyama, K.: Index structures for virtual memory-comparison between B-trees and M-trees. IBM Research Report RC5258 (1975)"},{"key":"16_CR57","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1137\/0208004","volume":"8","author":"R. E. Miller","year":"1979","unstructured":"Miller, R.E., Pippenger, N., Rosenberg, A.L., and Snyder, L.: Optimal 2\u20133-trees. SIAM J. Comput. 8 (1979), 42\u201359","journal-title":"SIAM J. Comput."},{"key":"16_CR58","unstructured":"Mizoguchi,T.: On required space for random split files. Proc. 17th Ann. Allerton Conference (1979)"},{"key":"16_CR59","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0020-0190(72)90015-4","volume":"1","author":"J. Nievergelt","year":"1972","unstructured":"Nievergelt, J., Prodels, J., Wong, C.K., and Yue, P.C.: Bounds on the weighted path length of binary trees. Inf. Process. Lett. 1 (1972), 220\u2013225","journal-title":"Inf. Process. Lett."},{"key":"16_CR60","doi-asserted-by":"crossref","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 (1973), 33\u201343","journal-title":"SIAM J. Comput."},{"key":"16_CR61","unstructured":"Nievergelt,J., and Wong,C.K.: On binary search trees, Information Processing 71, North-Holland Publishing Co., (1972), 91\u201398"},{"key":"16_CR62","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321738.321739","volume":"20","author":"J. Nievergelt","year":"1973","unstructured":"Nievergelt, J., and Wong, C.K.: Upper bounds for the total path length of binary trees. J. ACM 20 (1973), 1\u20136","journal-title":"J. ACM"},{"key":"16_CR63","unstructured":"Nakamura,T., and Mizoguchi,T.: An analysis of storage utilization factor in block split data structuring scheme. Proc. 4th VLDB Conference (1978)"},{"key":"16_CR64","unstructured":"Odlyzko,A.: Period oscillations of coefficients of power series that satisfy functional equations. Unpublished manuscript (1979)"},{"key":"16_CR65","unstructured":"Olivie,H.: On random son-trees. Int. J. Comp. Math. (1980) to appear"},{"key":"16_CR66","unstructured":"Olivie,H.: A new class of balanced search trees: half-balanced binary search trees. Unpublished manuscript (1980)"},{"key":"16_CR67","unstructured":"Olivie,H.: Doctoral dissertation. University of Antwerp, in preparation (1980)."},{"key":"16_CR68","unstructured":"Ottmann, Th., Rosenberg,A.L., Six,H.W., and Wood,D.: Minimal cost brother trees. SIAM J. Comput. (1980), to appear"},{"key":"16_CR69","doi-asserted-by":"crossref","unstructured":"Ottmann,Th., and Stucky,W.: Higher order analysis of 1\u20132 brother trees. BIT (1980), to appear","DOI":"10.1007\/BF01932772"},{"key":"16_CR70","doi-asserted-by":"crossref","unstructured":"Ottmann,Th., and Wood,D.: 1\u20132 brother trees or AVL trees revisited. Comput. J. (1980), to appear","DOI":"10.1093\/comjnl\/23.3.248"},{"key":"16_CR71","unstructured":"Ottmann,Th., and Wood,D.: A comparison of iterative and defined classes of search trees. In preparation (1980)"},{"key":"16_CR72","unstructured":"Patzak,E.: Dichte 3-weg Baeume. Diplomarbeit, Universitaet Karlsruhe (1978)"},{"key":"16_CR73","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/321879.321883","volume":"22","author":"Y. Perl","year":"1975","unstructured":"Perl, Y., Garey, M.R., and Even, S.: Efficient generation of optimal prefix codes: equiprobable words using unequal cost letters. J. ACM 22 (1975), 202\u2013214","journal-title":"J. ACM"},{"key":"16_CR74","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0306-4379(80)90064-2","volume":"5","author":"K. H. Quitzow","year":"1980","unstructured":"Quitzow, K.H., and Klopprogge, M.R.: Space utilization and access path length in B-trees. Inform. Systems 5 (1980), 7\u201316","journal-title":"Inform. Systems"},{"key":"16_CR75","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1147\/rd.172.0101","volume":"17","author":"J. Rissanen","year":"1973","unstructured":"Rissanen, J.: Bounds for weighted balanced trees. IBM J. Res. Dev. 17 (1973), 101\u2013106","journal-title":"IBM J. Res. Dev."},{"key":"16_CR76","first-page":"151","volume":"11","author":"J. M. Robson","year":"1979","unstructured":"Robson, J.M.: The height of binary search trees. Australian Computer Journal 11 (1979), 151\u2013153","journal-title":"Australian Computer Journal"},{"key":"16_CR77","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/0207037","volume":"7","author":"A. L. Rosenberg","year":"1978","unstructured":"Rosenberg, A.L., and Snyder, L.: Minimal-comparison 2\u20133-trees. SIAM J. Comput. 7 (1978), 465\u2013480","journal-title":"SIAM J. Comput."},{"key":"16_CR78","unstructured":"Rosenberg,A.L., and Snyder,L.: Compact B-trees. IBM Research Report RC7343 (1978)"},{"key":"16_CR79","doi-asserted-by":"crossref","unstructured":"Ruskey,F.: On the average shape of binary trees. SIAM J. Comput. (1980), to appear","DOI":"10.1137\/0601007"},{"key":"16_CR80","unstructured":"Six,H.W.: Search cost optimal brother trees. In preparation (1980)"},{"key":"16_CR81","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF00288649","volume":"3","author":"M. Schlumberger","year":"1973","unstructured":"Schlumberger, M., and Vuillemin, J.: Optimal disc merge patterns, Acta Informatica 3, (1973), 25\u201335","journal-title":"Acta Informatica"},{"key":"16_CR82","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF00289093","volume":"11","author":"K. Unterauer","year":"1979","unstructured":"Unterauer, K.: Dynamic weighted binary search trees. Acta Informatica 11 (1979), 341\u2013362","journal-title":"Acta Informatica"},{"key":"16_CR83","doi-asserted-by":"crossref","unstructured":"Vaishnavi,V.K., Kriegel,H.P., and Wood,D.: Optimum multiway search trees. Acta Informatica (1980), to appear","DOI":"10.1007\/BF00288540"},{"issue":"4","key":"16_CR84","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1093\/comjnl\/19.4.322","volume":"19","author":"A. Walker","year":"1976","unstructured":"Walker, A., and Wood, D.: Locally balanced binary trees. Comput. J., 19(4), (1976), 322\u2013325","journal-title":"Comput. J."},{"key":"16_CR85","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0020-0190(76)90052-1","volume":"4","author":"R. L. Wessner","year":"1976","unstructured":"Wessner, R.L.: Optimum alphabetic search trees with restricted maximal height. Inf. Process. Lett. 4 (1976), 90\u201394","journal-title":"Inf. Process. Lett."},{"key":"16_CR86","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289075","volume":"9","author":"A. C. C. C. Yao","year":"1978","unstructured":"Yao, A.C.C.: On random 2\u20133-trees. Acta Informatica 9 (1978), 159\u2013170","journal-title":"Acta Informatica"},{"key":"16_CR87","unstructured":"Zaki,A., and Baer,J.L.: A comparison of query costs in AVL and 2\u20133-trees. University of Washington Computer Science Technical Report 78-02-01 (1978)"},{"key":"16_CR88","unstructured":"Ziviani,N.: Performance evaluation of symmetric binary B-trees. Unpublished manuscript (1980)"}],"container-title":["Lecture Notes in Computer Science","Graphtheoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10291-4_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:56Z","timestamp":1605643376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10291-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540102915","9783540384359"],"references-count":88,"URL":"https:\/\/doi.org\/10.1007\/3-540-10291-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}