{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:03:04Z","timestamp":1783576984018,"version":"3.55.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031389054","type":"print"},{"value":"9783031389061","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-38906-1_31","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"474-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or\u00a0Persistent"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5931-771X","authenticated-orcid":false,"given":"Ofek","family":"Gila","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8943-191X","authenticated-orcid":false,"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7505-5768","authenticated-orcid":false,"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"31_CR1","unstructured":"Acar, U.A.: Self-adjusting computation. Ph.D. thesis, Carnegie Mellon University (2005)"},{"issue":"6","key":"31_CR2","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00446-014-0229-0","volume":"27","author":"Y Afek","year":"2014","unstructured":"Afek, Y., Kaplan, H., Korenfeld, B., Morrison, A., Tarjan, R.E.: The CB tree: a practical concurrent self-adjusting search tree. Distrib. Comput. 27(6), 393\u2013417 (2014). https:\/\/doi.org\/10.1007\/s00446-014-0229-0","journal-title":"Distrib. Comput."},{"key":"31_CR3","volume-title":"The Probabilistic Method","author":"N Alon","year":"2016","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 4th edn. Wiley, Hoboken (2016)","edition":"4"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00453-004-1138-6","volume":"42","author":"A Bagchi","year":"2005","unstructured":"Bagchi, A., Buchsbaum, A.L., Goodrich, M.T.: Biased skip lists. Algorithmica 42, 31\u201348 (2005)","journal-title":"Algorithmica"},{"key":"31_CR5","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Conway, A., Farach-Colton, M., Kuszmaul, W., Tagliavini, G.: Tiny pointers. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 477\u2013508 (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.ch21, https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611977554.ch21","DOI":"10.1137\/1.9781611977554.ch21"},{"issue":"3","key":"31_CR6","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0214041","volume":"14","author":"SW Bent","year":"1985","unstructured":"Bent, S.W., Sleator, D.D., Tarjan, R.E.: Biased search trees. SIAM J. Comput. 14(3), 545\u2013568 (1985)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"31_CR7","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1145\/5925.5930","volume":"33","author":"L Devroye","year":"1986","unstructured":"Devroye, L.: A note on the height of binary search trees. J. ACM 33(3), 489\u2013498 (1986)","journal-title":"J. ACM"},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF00265991","volume":"24","author":"L Devroye","year":"1987","unstructured":"Devroye, L.: Branching processes in the analysis of the heights of trees. Acta Inform. 24(3), 277\u2013298 (1987)","journal-title":"Acta Inform."},{"key":"31_CR9","doi-asserted-by":"publisher","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comput. Syst. Sci. 38(1), 86\u2013124 (1989). https:\/\/doi.org\/10.1016\/0022-0000(89)90034-2, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0022000089900342","DOI":"10.1016\/0022-0000(89)90034-2"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-319-94821-8_12","volume-title":"Interactive Theorem Proving","author":"M Eberl","year":"2018","unstructured":"Eberl, M., Haslbeck, M.W., Nipkow, T.: Verified analysis of random binary tree structures. In: Avigad, J., Mahboubi, A. (eds.) ITP 2018. LNCS, vol. 10895, pp. 196\u2013214. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94821-8_12"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","volume":"25","author":"P Flajolet","year":"1982","unstructured":"Flajolet, P., Odlyzko, A.: The average height of binary trees and other simple trees. J. Comput. Syst. Sci. 25(2), 171\u2013213 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"31_CR12","volume-title":"Algorithm Design and Applications","author":"MT Goodrich","year":"2015","unstructured":"Goodrich, M.T., Tamassia, R.: Algorithm Design and Applications. Wiley, Hoboken (2015)"},{"key":"31_CR13","doi-asserted-by":"publisher","unstructured":"Guo, B.N., Qi, F.: Sharp bounds for harmonic numbers. Appl. Math. Comput. 218(3), 991\u2013995 (2011). https:\/\/doi.org\/10.1016\/j.amc.2011.01.089, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S009630031100124X","DOI":"10.1016\/j.amc.2011.01.089"},{"issue":"6","key":"31_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T Hagerup","year":"1990","unstructured":"Hagerup, T., R\u00fcb, C.: A guided tour of Chernoff bounds. Inf. Process. Lett. 33(6), 305\u2013308 (1990)","journal-title":"Inf. Process. Lett."},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00453-004-1140-z","volume":"42","author":"JD Hartline","year":"2005","unstructured":"Hartline, J.D., Hong, E.S., Mohr, A.E., Pentney, W.R., Rocke, E.C.: Characterizing history independent data structures. Algorithmica 42, 57\u201374 (2005)","journal-title":"Algorithmica"},{"issue":"2","key":"31_CR16","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/274787.274812","volume":"45","author":"C Mart\u00ednez","year":"1998","unstructured":"Mart\u00ednez, C., Roura, S.: Randomized binary search trees. J. ACM 45(2), 288\u2013323 (1998). https:\/\/doi.org\/10.1145\/274787.274812","journal-title":"J. ACM"},{"key":"31_CR17","volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"M Mitzenmacher","year":"2017","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis, 2nd edn. Cambridge University Press, Cambridge (2017)","edition":"2"},{"key":"31_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"2","key":"31_CR19","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/BF01994884","volume":"32","author":"T Papadakis","year":"1992","unstructured":"Papadakis, T., Ian Munro, J., Poblete, P.V.: Average search and update costs in skip lists. BIT Numer. Math. 32(2), 316\u2013332 (1992)","journal-title":"BIT Numer. Math."},{"issue":"6","key":"31_CR20","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668\u2013676 (1990). https:\/\/doi.org\/10.1145\/78973.78977","journal-title":"Commun. ACM"},{"issue":"3","key":"31_CR21","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1145\/765568.765571","volume":"50","author":"B Reed","year":"2003","unstructured":"Reed, B.: The height of a random binary search tree. J. ACM 50(3), 306\u2013332 (2003)","journal-title":"J. ACM"},{"issue":"7","key":"31_CR22","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.E.: Planar point location using persistent search trees. Commun. ACM 29(7), 669\u2013679 (1986)","journal-title":"Commun. ACM"},{"issue":"4\u20135","key":"31_CR23","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/BF01940876","volume":"16","author":"R Seidel","year":"1996","unstructured":"Seidel, R., Aragon, C.R.: Randomized search trees. Algorithmica 16(4\u20135), 464\u2013497 (1996)","journal-title":"Algorithmica"},{"key":"31_CR24","first-page":"1","volume":"38","author":"D Shiu","year":"2022","unstructured":"Shiu, D.: Efficient computation of tight approximations to Chernoff bounds. Comput. Stat. 38, 1\u201315 (2022)","journal-title":"Comput. Stat."},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: 13th ACM Symposium on Theory of Computing (STOC), pp. 114\u2013122 (1981)","DOI":"10.1145\/800076.802464"},{"key":"31_CR26","doi-asserted-by":"publisher","unstructured":"Tarjan, R.E., Levy, C., Timmel, S.: Zip trees. ACM Trans. Algorithms 17(4), 34:1\u201334:12 (2021). https:\/\/doi.org\/10.1145\/3476830","DOI":"10.1145\/3476830"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:08:34Z","timestamp":1690474114000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","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":"92","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":"47","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":"51% - 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.1","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":"10","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)"}}]}}