{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T23:09:20Z","timestamp":1770332960728,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540571551","type":"print"},{"value":"9783540479185","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_236","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:07:25Z","timestamp":1330258045000},"page":"60-71","source":"Crossref","is-referenced-by-count":25,"title":["Balanced search trees made simple"],"prefix":"10.1007","author":[{"given":"Arne","family":"Andersson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"2","key":"8_CR1","first-page":"1259","volume":"146","author":"G. M. Adelson-Velskii","year":"1962","unstructured":"G. M. Adelson-Velskii and E. M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2):1259\u20131262, 1962.","journal-title":"Dokladi Akademia Nauk SSSR"},{"key":"8_CR2","volume-title":"ISBN 0-201-00023-7","author":"A. V. Aho","year":"1983","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, Massachusetts, 1983. ISBN 0-201-00023-7."},{"issue":"10","key":"8_CR3","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1002\/spe.4380211009","volume":"21","author":"A. Andersson","year":"1991","unstructured":"A. Andersson. A note on searching in a binary search tree. Software-Practice and Experience, 21(10):1125\u20131128, 1991.","journal-title":"Software-Practice and Experience"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01237235","volume":"28","author":"A. Andersson","year":"1990","unstructured":"A. Andersson, Ch. Icking, R. Klein, and Th. Ottmann. Binary search trees of almost optimal height. Acta Inormatica, 28:165\u2013178, 1990.","journal-title":"Acta Inormatica"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"R. Bayer. Binary B-trees for virtual memory. In Proc. ACM SIGIFIDET Workshop on Data Description, Access and control, pages 219\u2013235, 1971.","DOI":"10.1145\/1734714.1734731"},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer. Symmetrie binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1(4):290\u2013306, 1972.","journal-title":"Acta Informatica"},{"key":"8_CR7","unstructured":"S. D. Conte, H. E. Dunsmore, and V. Y. Shen. Software Engineering Metrics and Models. The Benjamin\/Cummings Publishing Company Inc., 1986. ISBN 0-8053-2162-4."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th Ann. IEEE Symp. on Foundations of Computer Science, pages 8\u201321, 1978.","DOI":"10.1109\/SFCS.1978.3"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(76)90094-6","volume":"5","author":"H. A. Maurer","year":"1976","unstructured":"H. A. Maurer, Th. Ottmann, and H. W. Six. Implementing dictionaries using binary trees of very small height. Information Processing Letters, 5(1):11\u201314, 1976.","journal-title":"Information Processing Letters"},{"key":"8_CR10","unstructured":"J. I. Munro, Th. Papadakis, and R. Sedgewick. Deterministic skip lists. In Proc. Symp. of Discrete Algorithms, pages 367\u2013375, 1992."},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J. Nievergelt","year":"1973","unstructured":"J. Nievergelt and E. M. Reingold. Binary trees of bounded balance. SIAM Journal on Computing, 2(1):33\u201343, 1973.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR12","first-page":"51","volume":"16","author":"H. J. Olivie","year":"1982","unstructured":"H. J. Olivie. A new class of balanced search trees: Half-balanced binary search trees. R. A. I. R. O. Informatique Theoretique, 16:51\u201371, 1982.","journal-title":"R. A. I. R. O. Informatique Theoretique"},{"key":"8_CR13","unstructured":"Th. Papadakis. private communication."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"W. Pugh. Skip lists: A probabilistic alternative to balanced trees. In Proc. Workshop on Algorithms and Data Structures, WADS '89, Ottawa, pages 437\u2013449, 1989.","DOI":"10.1007\/3-540-51542-9_36"},{"key":"8_CR15","volume-title":"ISBN 0-13-022005-1","author":"N. Wirth","year":"1986","unstructured":"N. Wirth. Algorithms and Data Structures. Prentice-Hall, Englewood Cliffs, New Jersey, 1986. ISBN 0-13-022005-1."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_236.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:58:36Z","timestamp":1619571516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_236","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}