{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:56:38Z","timestamp":1743087398840,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199548"},{"type":"electronic","value":"9783030199555"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_9","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"93-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Belga B-Trees"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigorios","family":"Koumoutsos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"key":"9_CR1","first-page":"263","volume":"146","author":"GM Adelson-Velski\u012d","year":"1962","unstructured":"Adelson-Velski\u012d, G.M., Landis, E.M.: An algorithm for organization of information. Dokl. Akad. Nauk SSSR 146, 263\u2013266 (1962)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"9","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2007.03.002","volume":"382","author":"M Badoiu","year":"2007","unstructured":"Badoiu, M., Cole, R., Demaine, E.D., Iacono, J.: A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382(2), 86\u201396 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indices. Acta Inf. 1, 173\u2013189 (1972)","journal-title":"Acta Inf."},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1007\/s00453-016-0224-x","volume":"76","author":"P Bose","year":"2016","unstructured":"Bose, P., Dou\u00efeb, K., Iacono, J., Langerman, S.: The power and limitations of static binary search trees with lazy finger. Algorithmica 76(4), 1264\u20131275 (2016)","journal-title":"Algorithmica"},{"key":"9_CR6","unstructured":"Bose, P., Dou\u00efeb, K., Langerman, S.: Dynamic optimality for skip lists and b-trees. In Symposium on Discrete Algorithms, SODA, pp. 1106\u20131114 (2008)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-40273-9_10","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","author":"P Bose","year":"2013","unstructured":"Bose, P., Howat, J., Morin, P.: A history of distribution-sensitive data structures. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066, pp. 133\u2013149. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40273-9_10"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40273-9","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","year":"2013","unstructured":"Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.): Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40273-9"},{"key":"9_CR9","unstructured":"Chalermsook, P., Goswami, M., Kozma, L., Mehlhorn, K., Saranurak, T.: The landscape of bounds for binary search trees. CoRR, abs\/1603.04892 (2016)"},{"key":"9_CR10","unstructured":"Chalermsook, P., Goswami, M., Kozma, L., Mehlhorn, K., Saranurak, T.: Multi-finger binary search trees. In 29th International Symposium on Algorithms and Computation, ISAAC, pp. 55:1\u201355:26 (2018)"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S009753979732699X","volume":"30","author":"R Cole","year":"2000","unstructured":"Cole, R.: On the dynamic finger conjecture for splay trees. Part II: the proof. SIAM J. Comput. 30(1), 44\u201385 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539797326988","volume":"30","author":"R Cole","year":"2000","unstructured":"Cole, R., Mishra, B., Schmidt, J.P., Siegel, A.: On the dynamic finger conjecture for splay trees. Part I: splay sorting log n-block sequences. SIAM J. Comput. 30(1), 1\u201343 (2000)","journal-title":"SIAM J. Comput."},{"key":"9_CR13","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Harmon, D., Iacono, J., Kane, D.M., Patrascu, M.: The geometry of binary search trees. In: Symposium on Discrete Algorithms, SODA, pp. 496\u2013505 (2009)","DOI":"10.1137\/1.9781611973068.55"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/S0097539705447347","volume":"37","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., Harmon, D., Iacono, J., Patrascu, M.: Dynamic optimality - almost. SIAM J. Comput. 37(1), 240\u2013251 (2007)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00453-013-9856-2","volume":"72","author":"ED Demaine","year":"2015","unstructured":"Demaine, E.D., Iacono, J., Langerman, S.: Worst-case optimal tree layout in external memory. Algorithmica 72(2), 369\u2013378 (2015)","journal-title":"Algorithmica"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-39206-1_33","volume-title":"Automata, Languages, and Programming","author":"ED Demaine","year":"2013","unstructured":"Demaine, E.D., Iacono, J., Langerman, S., \u00d6zkan, \u00d6.: Combining binary search trees. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 388\u2013399. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_33"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00236-013-0180-8","volume":"50","author":"A Elmasry","year":"2013","unstructured":"Elmasry, A., Farzan, A., Iacono, J.: On the hierarchy of distribution-sensitive properties for data structures. Acta Inf. 50(4), 289\u2013295 (2013)","journal-title":"Acta Inf."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: Foundations of Computer Science (FOCS), pp. 8\u201321 (1978)","DOI":"10.1109\/SFCS.1978.3"},{"key":"9_CR20","unstructured":"Howat, J., Iacono, J., Morin, P.: The fresh-finger property. CoRR, abs\/1302.6914 (2013)"},{"key":"9_CR21","unstructured":"Iacono, J.: Alternatives to splay trees with o(log n) worst-case access times. In: Symposium on Discrete Algorithms (SODA), pp. 516\u2013522 (2001)"},{"key":"9_CR22","unstructured":"Iacono, J.: Distribution Sensitive Data Structures. PhD thesis, Ph.D. Thesis. Rutgers, The State University of New Jersey (2001)"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-40273-9_16","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","author":"J Iacono","year":"2013","unstructured":"Iacono, J.: In pursuit of the dynamic optimality conjecture. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066, pp. 236\u2013250. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40273-9_16"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Iacono, J., Langerman, S.: Weighted dynamic finger in binary search trees. In: Symposium on Discrete Algorithms, SODA, pp. 672\u2013691 (2016)","DOI":"10.1137\/1.9781611974331.ch49"},{"key":"9_CR25","unstructured":"Lucas, J.M.: Canonical forms for competitive binary search tree algorithms. Technical Report DCS-TR-250, Rutgers University (1988)"},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1006\/jagm.1995.1026","volume":"19","author":"M Sherk","year":"1995","unstructured":"Sherk, M.: Self-adjusting k-ary search trees. J. Algorithms 19(1), 25\u201344 (1995)","journal-title":"J. Algorithms"},{"issue":"2","key":"9_CR27","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"issue":"3","key":"9_CR28","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"issue":"4","key":"9_CR29","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF02579253","volume":"5","author":"R Endre","year":"1985","unstructured":"Endre, R.: Sequential access in play trees takes linear time. Combinatorica 5(4), 367\u2013378 (1985)","journal-title":"Combinatorica"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Wang, C.C., Derryberry, J., Sleator, D.D.: O(log log n)-competitive dynamic binary search trees. In: Symposium on Discrete Algorithms, SODA, pp. 374\u2013383 (2006)","DOI":"10.1145\/1109557.1109600"},{"issue":"1","key":"9_CR31","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0218004","volume":"18","author":"RE Wilber","year":"1989","unstructured":"Wilber, R.E.: Lower bounds for accessing binary search trees with rotations. SIAM J. Comput. 18(1), 56\u201367 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:32:58Z","timestamp":1710361978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}