{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:50:26Z","timestamp":1743087026029,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030692438"},{"type":"electronic","value":"9783030692445"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-69244-5_27","type":"book-chapter","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T16:36:12Z","timestamp":1613838972000},"page":"304-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Relaxed Balanced Lock-Free Binary Search Tree"],"prefix":"10.1007","author":[{"given":"Manish","family":"Singh","sequence":"first","affiliation":[]},{"given":"Lindsay","family":"Groves","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Potanin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,21]]},"reference":[{"key":"27_CR1","first-page":"1","volume-title":"Distributed Computing","author":"Y Afek","year":"2012","unstructured":"Afek, Y., Kaplan, H., Korenfeld, B., Morrison, A., Tarjan, R.E.: Cbtree: a practical concurrent self-adjusting search tree. In: Aguilera, M.K. (ed.) Distributed Computing, pp. 1\u201315. Springer, Berlin, Heidelberg (2012)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Barnes, G.: A method for implementing lock-free shared-data structures. In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 261\u2013270. SPAA 1993 (1993)","DOI":"10.1145\/165231.165265"},{"key":"27_CR3","unstructured":"Boug\u00e9, L., Vall\u00e9s, J., Peypoch, X.M., Schabanel, N.: Height-relaxed avl rebalancing: a unified, fine-grained approach to concurrent dictionaries (1998)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-40047-6_25","volume-title":"Euro-Par 2013 Parallel Processing","author":"T Crain","year":"2013","unstructured":"Crain, T., Gramoli, V., Raynal, M.: A contention-friendly binary search tree. In: Wolf, F., Mohr, B., an Mey, D. (eds.) Euro-Par 2013. LNCS, vol. 8097, pp. 229\u2013240. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40047-6_25"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Drachsler, D., Vechev, M., Yahav, E.: Practical concurrent binary search trees via logical ordering. In: Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 343\u2013356, PPoPP 2014. Association for Computing Machinery, New York, NY, USA (2014)","DOI":"10.1145\/2692916.2555269"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Faith Ellen, P., Fatourou, E.R., van Breugel, F.: Non-blocking binary search trees. In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010, pp. 131\u2013140 (2010)","DOI":"10.1145\/1835698.1835736"},{"key":"27_CR7","unstructured":"Fraser, K.: Practical Lock freedom. Ph.D. thesis, King\u2019s College, University of Cambridge September 2003"},{"key":"27_CR8","unstructured":"Guerraoui, R.: Ascylib, July 2020. https:\/\/dcl.epfl.ch\/site\/optik"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45414-4_21","volume-title":"Distributed Computing","author":"TL Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J. (ed.) DISC 2001. LNCS, vol. 2180, pp. 300\u2013314. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45414-4_21"},{"key":"27_CR10","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2008)"},{"issue":"11","key":"27_CR11","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1145\/182.358442","volume":"26","author":"JLW Kessels","year":"1983","unstructured":"Kessels, J.L.W.: On-the-fly optimization of data structures. Commun. ACM 26(11), 895\u2013901 (1983)","journal-title":"Commun. ACM"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1006\/jcss.2000.1705","volume":"61","author":"KS Larsen","year":"2000","unstructured":"Larsen, K.S.: Avl trees with relaxed balance. J. Comput. Syst. Sci. 61(3), 508\u2013522 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR13","unstructured":"Singh, M., Lindsay Groves, A.P.: A relaxed balanced lock-free binary search tree. Tech. rep. (2020). https:\/\/ecs.wgtn.ac.nz\/Main\/TechnicalReportSeries"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Natarajan, A., Mittal, N.: Fast concurrent lock-free binary search trees. In: Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 317\u2013328. PPoPP 2014, New York, NY, USA (2014)","DOI":"10.1145\/2692916.2555256"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: A practical concurrent binary search tree. In: ACM SIGPLAN Symposium on Principals and Practice of Parallel Programming (2010)","DOI":"10.1145\/1693453.1693488"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Nurmi, O., Soisalon-Soininen, E.: Uncoupling updating and rebalancing in chromatic binary search trees. In: Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART, pp. 192\u2013198. PODS 1991, New York, NY, USA (1991)","DOI":"10.1145\/113413.113430"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Shane V. Howley, J.J.: A non blocking internal binary tree. SPAA, June 2012","DOI":"10.1145\/2312005.2312036"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Brown, T., Ellen, F., Ruppert, E.: A general technique for non-blocking trees. In: Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) (2014)","DOI":"10.1145\/2555243.2555267"},{"key":"27_CR19","unstructured":"Valois, J.D.: Lock-Free Data Structures. Ph.D. thesis, Rensselaer Polytechnic Institute, Troy, NY, USA (1996)"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69244-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T16:48:35Z","timestamp":1613839715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69244-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030692438","9783030692445"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69244-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"21 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hpcc.siat.ac.cn\/meeting\/pdcat-paap2020\/index.html","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","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":"34","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":"31% - 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":"6","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)"}}]}}