{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T07:27:39Z","timestamp":1725694059564},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540079125"},{"type":"electronic","value":"9783642952890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1976]]},"DOI":"10.1007\/978-3-642-95289-0_22","type":"book-chapter","created":{"date-parts":[[2012,7,28]],"date-time":"2012-07-28T20:50:54Z","timestamp":1343508654000},"page":"301-313","source":"Crossref","is-referenced-by-count":5,"title":["Binary Search Trees: Average and Worst Case Behavior (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Reiner","family":"G\u00fcttler","sequence":"first","affiliation":[]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Wernet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Information Theory","author":"Ash","year":"1965","unstructured":"[Ash], \u201cInformation Theory\u201d, Interscience Publishers, N.Y. 1965"},{"key":"22_CR2","volume-title":"Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees","author":"P Bayer","year":"1975","unstructured":"[Bayer, P.], \u201cImproved Bounds on the Costs of Optimal and Balanced Binary Search Trees\u201d, MIT, 1975"},{"key":"22_CR3","volume-title":"Nearly Optimal Binary Search Trees","author":"J Bruno","year":"1971","unstructured":"[Bruno, J. & Coffman, E.G.], \u201cNearly Optimal Binary Search Trees\u201d Proc. IFIP Congress 1971"},{"key":"22_CR4","volume-title":"Two Applications of a Probabilistic Search Technique Sorting X+Y and Building Balanced Search Trees","author":"ML Fredman","year":"1975","unstructured":"[Fredman, M.L.], \u201cTwo Applications of a Probabilistic Search Technique Sorting X+Y and Building Balanced Search Trees\u201d, Proc. 7th Annual ACM Symp. 1975"},{"key":"22_CR5","volume-title":"Variable Length Encodings","author":"EN Gilbert","year":"1971","unstructured":"[Gilbert, E.N. & Moore, E.F.], \u201cVariable Length Encodings\u201d Bell System Technical Journal, 1971"},{"key":"22_CR6","volume-title":"A Top-Down Algorithm for Constructing Nearly Optimal Lexicographical Trees","author":"CC Gotlieb","year":"1972","unstructured":"[Gotlieb, C.C. & Walker, W. A.], \u201cA Top-Down Algorithm for Constructing Nearly Optimal Lexicographical Trees\u201d Graph Theory and Computing, Academic Press, 1972"},{"key":"22_CR7","volume-title":"Bin\u00e4re Suchb\u00e4ume","author":"R G\u00fcttler","year":"1976","unstructured":"[G\u00fcttler, R.], \u201cBin\u00e4re Suchb\u00e4ume\u201d, Diplomarbeit, FB 10, Universit\u00e4t des Saarlandes, 1976"},{"key":"22_CR8","volume-title":"Schranken f\u00fcr Balanced Trees bei ausgewogenen Verteilungen","author":"G Hotz","year":"1975","unstructured":"[Hotz, G.], \u201cSchranken f\u00fcr Balanced Trees bei ausgewogenen Verteilungen\u201d, Universit\u00e4t des Saarlandes, Techn. Bericht, 1975"},{"key":"22_CR9","volume-title":"Optimal Computer Serach Trees and Variable Length Alphabetic Codes","author":"TC Hu","year":"1971","unstructured":"[Hu, T.C & Tucker, A.C.], \u201cOptimal Computer Serach Trees and Variable Length Alphabetic Codes\u201d, Siam J. Applied Math. 21, 1971"},{"key":"22_CR10","volume-title":"Optimum Binary Search Trees","author":"DE Knuth","year":"1971","unstructured":"[Knuth, D.E. 71], \u201cOptimum Binary Search Trees\u201d, Acta Informatica I, 1971"},{"key":"22_CR11","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1973","unstructured":"[Knuth, D.E., 73] \u201cThe Art of Computer Programming\u201d, Vol. III, Addison-Wesley, 1973"},{"key":"22_CR12","volume-title":"Nearly Optimal Binary Search Trees","author":"K Mehlhorn","year":"1975","unstructured":"[Mehlhorn, K. 75a], \u201cNearly Optimal Binary Search Trees\u201d, Acta Informatica 5, 1975"},{"key":"22_CR13","series-title":"GI Fachtagung f\u00fcr Automatentheorie und formale Sprachen, Springer Lecture Notes in Computer Science","volume-title":"Best Possible Bounds on the Weighted Path Length of Optimum Binary Search Trees","author":"K Mehlhorn","year":"1975","unstructured":"[Mehlhorn, K, 75b], \u201cBest Possible Bounds on the Weighted Path Length of Optimum Binary Search Trees\u201d, GI Fachtagung f\u00fcr Automatentheorie und formale Sprachen, Springer Lecture Notes in Computer Science Vol. 33. 1975"},{"key":"22_CR14","volume-title":"Bounds for Weight Balanced Trees","author":"J Rissanen","year":"1973","unstructured":"[Rissanen, J.], \u201cBounds for Weight Balanced Trees\u201d, IBM Journal of Research and Development, 1973"},{"key":"22_CR15","volume-title":"Bin\u00e4re Suchb\u00e4ume","author":"W Schneider","year":"1976","unstructured":"[Schneider, W.], \u201cBin\u00e4re Suchb\u00e4ume\u201d, Diplomarbeit, FB 10 Universit\u00e4t des Saarlandes, 1976"},{"key":"22_CR16","volume-title":"Two Algorithms for Nearly Optimal Binary Search Trees","author":"CP Schnorr","year":"1974","unstructured":"[Schnorr, C.P.], \u201cTwo Algorithms for Nearly Optimal Binary Search Trees\u201d, Universit\u00e4t Frankfurt, 1974"},{"key":"22_CR17","volume-title":"Bin\u00e4re Suchb\u00e4ume, Diplomarbeit, FB 10","author":"N Wernet","year":"1976","unstructured":"[Wernet, N.], \u201cBin\u00e4re Suchb\u00e4ume, Diplomarbeit, FB 10, Universit\u00e4t des Saarlandes, 1976"}],"container-title":["GI \u2014 6. Jahrestagung"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-95289-0_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T20:09:25Z","timestamp":1606507765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-95289-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"ISBN":["9783540079125","9783642952890"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-95289-0_22","relation":{},"subject":[],"published":{"date-parts":[[1976]]}}}