{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T20:37:28Z","timestamp":1693427848734},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1007\/bf00263296","type":"journal-article","created":{"date-parts":[[2004,9,27]],"date-time":"2004-09-27T12:15:17Z","timestamp":1096287317000},"page":"583-594","source":"Crossref","is-referenced-by-count":12,"title":["Improving time and space efficiency in generalized binary search trees"],"prefix":"10.1007","volume":"24","author":[{"given":"Walter","family":"Cunto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose Luis","family":"Gascon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1987,9,1]]},"reference":[{"key":"BF00263296_CR1","first-page":"263","volume":"146","author":"G.M. Adel'son-Vel'skii","year":"1962","unstructured":"Adel'son-Vel'skii, G.M., Landins, E.M.: An Algorithm for the Organization of Information. Doklady Akademia Nauk USSR 146, 263\u2013266 (1962)","journal-title":"Doklady Akademia Nauk USSR"},{"key":"BF00263296_CR2","unstructured":"Bell, C.J.: An Investigation into the Principles of the Classification and Analysis on an Automatic Digital Computer. Doctoral Thesis, Leeds University 1965"},{"key":"BF00263296_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional Binary Search Trees Use for Associative Searching. Commun ACM 18, 509\u2013517 (1975)","journal-title":"Commun ACM"},{"key":"BF00263296_CR4","unstructured":"Cunto, W., Lau, G.: Generalised Multidimensional Trees. TECH-REP CSC 87-02 Centro Cientifico IBM de Venezuela"},{"key":"BF00263296_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(82)90534-4","volume":"55","author":"B. Eisenbarth","year":"1984","unstructured":"Eisenbarth, B., Ziviani, N., Gonnet, G.H., Melhorn, K., Wood, D.: The Theory of Fringe Analysis and its Application to 2\u20133 Trees and B-trees. Inf. Control 55, 125\u2013174 (1984)","journal-title":"Inf. Control"},{"key":"BF00263296_CR6","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1145\/358476.358509","volume":"26","author":"G.H. Gonnet","year":"1983","unstructured":"Gonnet, G.H.: Balancing Binary Trees by Internal Path Reduction. Commun. ACM 26, 1074\u20131081 (1983)","journal-title":"Commun. ACM"},{"key":"BF00263296_CR7","volume-title":"Handbook of Algorithms and Data Structures","author":"G.H. Gonnet","year":"1984","unstructured":"Gonnet, G.H.: Handbook of Algorithms and Data Structures. Reading, MA.: Addison Wesley 1984"},{"key":"BF00263296_CR8","volume-title":"The Art of Computer Programming, Vol. I. Fundamental Algorithms","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol. I. Fundamental Algorithms. 2nd Ed. Reading, MA.: Addison Wesley 1973","edition":"2nd Ed"},{"key":"BF00263296_CR9","volume-title":"The Art of Computer Programming, Vol. III. Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol. III. Sorting and Searching, Reading, MA.: Addison Wesley 1973"},{"key":"BF00263296_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF00263927","volume":"19","author":"K. Kuspert","year":"1983","unstructured":"Kuspert, K.: Storage Utilization in B-trees with a Generalized Overflow Technique. Acta Inf. 19, 33\u201355 (1983)","journal-title":"Acta Inf."},{"key":"BF00263296_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J. Nievergelt","year":"1973","unstructured":"Nievergelt, J.: Binary Search Trees of Bounded Balance. SIAM J. Comput. 2, 33\u201343 (1973)","journal-title":"SIAM J. Comput."},{"key":"BF00263296_CR12","unstructured":"Poblete, P.V.: Fringe Tecniques for Binary Search Trees. Ph. D. Thesis, C.S. Dept., University of Waterloo 1982"},{"key":"BF00263296_CR13","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/0196-6774(85)90003-3","volume":"6","author":"P.V. Poblete","year":"1985","unstructured":"Poblete, P.V., Munro J.I.: The Analysis of a Fringe Heuristic for Binary Search Trees. J. Algorithms 6, 336\u2013350 (1985)","journal-title":"J. Algorithms"},{"key":"BF00263296_CR14","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1093\/comjnl\/19.4.322","volume":"19","author":"A. Walker","year":"1976","unstructured":"Walker, A., Wood, D.: Locally Balanced Binary Trees. Comput. J. 19, 322\u2013325 (1976)","journal-title":"Comput. J."},{"key":"BF00263296_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00289075","volume":"9","author":"A. Yao","year":"1978","unstructured":"Yao, A.: On Random 2\u20133 Trees. Acta Inf. 9, 159\u2013170 (1978)","journal-title":"Acta Inf."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00263296.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00263296\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00263296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00263296.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T06:21:37Z","timestamp":1565936497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00263296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["BF00263296"],"URL":"https:\/\/doi.org\/10.1007\/bf00263296","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}