{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:46:40Z","timestamp":1743079600685,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319642024"},{"type":"electronic","value":"9783319642031"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64203-1_42","type":"book-chapter","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T15:03:35Z","timestamp":1501513415000},"page":"580-593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Concurrency-Optimal Binary Search Tree"],"prefix":"10.1007","author":[{"given":"Vitaly","family":"Aksenov","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Malova","sequence":"additional","affiliation":[]},{"given":"Srivatsan","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,1]]},"reference":[{"issue":"1","key":"42_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 123\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-48314-6_10","volume-title":"Structural Information and Communication Complexity","author":"V Gramoli","year":"2016","unstructured":"Gramoli, V., Kuznetsov, P., Ravi, S.: In the search for optimal concurrency. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 143\u2013158. Springer, Cham (2016). doi:10.1007\/978-3-319-48314-6_10"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"CH Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM 26, 631\u2013653 (1979)","journal-title":"J. ACM"},{"issue":"3","key":"42_CR4","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1006\/jcss.1998.1563","volume":"57","author":"VK Chaudhri","year":"1998","unstructured":"Chaudhri, V.K., Hadzilacos, V.: Safe locking policies for dynamic databases. J. Comput. Syst. Sci. 57(3), 260\u2013271 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"42_CR5","unstructured":"Sutter, H.: Choose concurrency-friendly data structures. Dr. Dobb\u2019s J. (2008)"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Heller, S., Herlihy, M., Luchangco, V., Moir, M., Scherer, W.N., Shavit, N.: A lazy concurrent list-based set algorithm. In: OPODIS, pp. 3\u201316 (2006)","DOI":"10.1007\/11795490_3"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Shavit, N.: On the nature of progress. In: OPODIS, pp. 313\u2013328 (2011)","DOI":"10.1007\/978-3-642-25873-2_22"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Henzinger, T.A., Singh, V.: Permissiveness in transactional memories. In: DISC, pp. 305\u2013319 (2008)","DOI":"10.1007\/978-3-540-87779-0_21"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Ravi, S.: On the cost of concurrency in transactional memory. In: International Conference on Principles of Distributed Systems (OPODIS), pp. 112\u2013127 (2011)","DOI":"10.1007\/978-3-642-25873-2_9"},{"key":"42_CR10","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., Mey, D. (eds.) Euro-Par 2013. LNCS, vol. 8097, pp. 229\u2013240. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40047-6_25"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Drachsler, D., Vechev, M., Yahav, E.: Practical concurrent binary search trees via logical ordering. In: Proceedings of 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014, pp. 343\u2013356 (2014)","DOI":"10.1145\/2692916.2555269"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: A practical concurrent binary search tree. In: PPoPP (2010)","DOI":"10.1145\/1693453.1693488"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Ellen, F., Fatourou, P., Ruppert, E., van Breugel, F.: Non-blocking binary search trees. In: PODC, pp. 131\u2013140 (2010)","DOI":"10.1145\/1835698.1835736"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Aksenov, V., Gramoli, V., Kuznetsov, P., Malova, A., Ravi, S.: A concurrency-optimal binary search tree. CoRR abs\/1702.04441 (2017)","DOI":"10.1007\/978-3-319-64203-1_42"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Natarajan, A., Mittal, N.: Fast concurrent lock-free binary search trees. In: PPoPP, pp. 317\u2013328 (2014)","DOI":"10.1145\/2692916.2555256"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Gramoli, V.: More than you ever wanted to know about synchronization: Synchrobench, measuring the impact of the synchronization on concurrent algorithms. In: PPoPP, pp. 1\u201310 (2015)","DOI":"10.1145\/2858788.2688501"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Gramoli, V., Kuznetsov, P., Ravi, S.: From sequential to concurrent: correctness and relative efficiency (brief announcement). In: Principles of Distributed Computing (PODC), pp. 241\u2013242 (2012)","DOI":"10.1145\/2332432.2332480"},{"key":"42_CR18","unstructured":"Gramoli, V., Kuznetsov, P., Ravi, S., Shang, D.: A concurrency-optimal list-based set (brief announcement). In: Distributed Computing - 29th International Symposium, DISC 2015, Tokyo, Japan, 7\u20139 October 2015"},{"key":"42_CR19","unstructured":"Cao Minh, C., Chung, J., Kozyrakis, C., Olukotun, K.: STAMP: Stanford transactional applications for multi-processing. In: IISWC (2008)"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Raynal, M.: A speculation-friendly binary search tree. In: PPoPP, pp. 161\u2013170 (2012)","DOI":"10.1145\/2370036.2145837"},{"key":"42_CR21","unstructured":"Siakavaras, D., Nikas, K., Goumas, G., Koziris, N.: Performance analysis of concurrent red-black trees on HTM platforms. In: 10th ACM SIGPLAN Workshop on Transactional Computing (Transact) (2015)"},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Howley, S.V., Jones, J.: A non-blocking internal binary search tree. In: SPAA, pp. 161\u2013171 (2012)","DOI":"10.1145\/2312005.2312036"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Chatterjee, B., Nguyen, N., Tsigas, P.: Efficient lock-free binary search trees. In: PODC (2014)","DOI":"10.1145\/2611462.2611500"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2017: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64203-1_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:08:16Z","timestamp":1627776496000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-64203-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319642024","9783319642031"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64203-1_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santiago de Compostela","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/europar2017.usc.es","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}