{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:28Z","timestamp":1725493528446},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_39","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"469-480","source":"Crossref","is-referenced-by-count":4,"title":["A New Method for Balancing Binary Search Trees"],"prefix":"10.1007","author":[{"given":"Salvador","family":"Roura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"issue":"2","key":"39_CR1","first-page":"263","volume":"146","author":"G.M. Adelson-Velskii","year":"1962","unstructured":"G.M. Adel\u2019son-Vel\u2019skii and E. M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2):263\u2013266, 1962. English translation in Soviet Math. Doklay 3, 1259-1263, 1962.","journal-title":"Dokladi Akademia Nauk SSSR"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1998.0967","volume":"30","author":"A. Andersson","year":"1999","unstructured":"A. Andersson. General balanced trees. Journal of Algorithms, 30:1\u201318, 1999.","journal-title":"Journal of Algorithms"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(80)90018-3","volume":"11","author":"N. Blum","year":"1980","unstructured":"N. Blum and K. Mehlhorn. On the average number of rebalancing operations in weight-balanced trees. TCS: Theoretical Computer Science, 11:303\u2013320, 1980.","journal-title":"TCS: Theoretical Computer Science"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. of the 19th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 8\u201321, October 1978.","DOI":"10.1109\/SFCS.1978.3"},{"key":"39_CR5","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, MA, 2nd edition, 1998.","edition":"2nd edition"},{"issue":"2","key":"39_CR6","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/274787.274812","volume":"45","author":"C. Mart\u00ednez","year":"1998","unstructured":"C. Mart\u00ednez and S. Roura. Randomized binary search trees. Journal of the ACM, 45(2):288\u2013323, March 1998.","journal-title":"Journal of the ACM"},{"issue":"1","key":"39_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J. Nievergelt","year":"1973","unstructured":"J. Nievergelt and E. Reingold. Binary search trees of bounded balance. SIAM Journal on Computing, 2(1):33\u201343, 1973.","journal-title":"SIAM Journal on Computing"},{"key":"39_CR8","unstructured":"R. Sedgewick. Algorithms in C. Addison-Wesley, 3rd edition, 1998."},{"issue":"3","key":"39_CR9","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"D.D. Sleator and R.E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652\u2013686, July 1985.","journal-title":"Journal of the ACM"},{"key":"39_CR10","unstructured":"M.A. Weiss. Data Structures \u2130 Algorithm Analysis in C++. Addison-Wesley, 2nd edition, 1999."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T19:11:57Z","timestamp":1551035517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}