{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T16:06:19Z","timestamp":1749485179063},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642400469"},{"type":"electronic","value":"9783642400476"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-40047-6_25","type":"book-chapter","created":{"date-parts":[[2013,7,20]],"date-time":"2013-07-20T12:18:02Z","timestamp":1374322682000},"page":"229-240","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["A Contention-Friendly Binary Search Tree"],"prefix":"10.1007","author":[{"given":"Tyler","family":"Crain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Mao, Y., Kohler, E., Morris, R.T.: Cache craftiness for fast multicore key-value storage. In: EuroSys., pp. 183\u2013196 (2012)","DOI":"10.1145\/2168836.2168855"},{"key":"25_CR2","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":"25_CR3","unstructured":"Adelson-Velskii, G., Landis, E.M.: An algorithm for the organization of information. In: Proc. of the USSR Academy of Sciences, vol.\u00a0146, pp. 263\u2013266 (1962)"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R.: Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica 1\u00a01(4), 290\u2013306 (1972)","journal-title":"Acta Informatica 1"},{"key":"25_CR5","unstructured":"Boug\u00e9, L., Gabarro, J., Messeguer, X., Schabanel, N.: Height-relaxed AVL rebalancing: A unified, fine-grained approach to concurrent dictionaries. Technical Report RR1998-18, ENS Lyon (1998)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: FOCS, pp. 8\u201321 (1978)","DOI":"10.1109\/SFCS.1978.3"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large ordered indices. In: Proc. of the ACM SIGFIDET Workshop on Data Description, Access and Control, pp. 107\u2013141 (1970)","DOI":"10.21236\/AD0712079"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00288968","volume":"17","author":"S. Huddleston","year":"1982","unstructured":"Huddleston, S., Mehlhorn, K.: A new data structure for representing sorted lists. Acta Inf.\u00a017, 157\u2013184 (1982)","journal-title":"Acta Inf."},{"issue":"11","key":"25_CR9","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1145\/182.358442","volume":"26","author":"J.L.W. Kessels","year":"1983","unstructured":"Kessels, J.L.W.: On-the-fly optimization of data structures. Commun. ACM\u00a026(11), 895\u2013901 (1983)","journal-title":"Commun. ACM"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Nurmi, O., Soisalon-Soininen, E.: Uncoupling updating and rebalancing in chromatic binary search trees. In: PODS, pp. 192\u2013198 (1991)","DOI":"10.1145\/113413.113430"},{"issue":"6","key":"25_CR11","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s002360050057","volume":"33","author":"O. Nurmi","year":"1996","unstructured":"Nurmi, O., Soisalon-Soininen, E.: Chromatic binary search trees. A structure for concurrent rebalancing. Acta Inf.\u00a033(6), 547\u2013557 (1996)","journal-title":"Acta Inf."},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1006\/jcss.1997.1511","volume":"55","author":"J. Boyar","year":"1997","unstructured":"Boyar, J., Fagerberg, R., Larsen, K.S.: Amortization results for chromatic search trees, with an application to priority queues. J. Comput. Syst. Sci.\u00a055(3), 504\u2013521 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR13","unstructured":"Mohan, C.: Commit-LSN: a novel and simple method for reducing locking and latching in transaction processing systems. In: VLDB, pp. 406\u2013418 (1990)"},{"key":"25_CR14","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":"T.L. Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 300\u2013314. Springer, Heidelberg (2001)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: SPAA, pp. 73\u201382 (2002)","DOI":"10.1145\/564870.564881"},{"key":"25_CR16","unstructured":"Fraser, K.: Practical lock freedom. PhD thesis, Cambridge University (September 2003)"},{"key":"25_CR17","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":"25_CR18","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming, p. 528. Morgan Kaufmann (2008)"},{"issue":"3","key":"25_CR19","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1897852.1897873","volume":"54","author":"N. Shavit","year":"2011","unstructured":"Shavit, N.: Data structures in the multicore age. Commun. ACM\u00a054(3), 76\u201384 (2011)","journal-title":"Commun. ACM"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-04355-0_12","volume-title":"Distributed Computing","author":"P. Felber","year":"2009","unstructured":"Felber, P., Gramoli, V., Guerraoui, R.: Elastic transactions. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 93\u2013107. Springer, Heidelberg (2009)"},{"key":"25_CR21","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":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-33651-5_39","volume-title":"Distributed Computing","author":"T. Crain","year":"2012","unstructured":"Crain, T., Gramoli, V., Raynal, M.: Brief announcement: A contention-friendly, non-blocking skip list. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 423\u2013424. Springer, Heidelberg (2012)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Raynal, M.: No hot spot non-blocking skip list. In: ICDCS (2013)","DOI":"10.1109\/ICDCS.2013.42"},{"key":"25_CR24","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst.\u00a012, 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-72951-8_11","volume-title":"Structural Information and Communication Complexity","author":"M.P. Herlihy","year":"2007","unstructured":"Herlihy, M.P., Lev, Y., Luchangco, V., Shavit, N.: A simple optimistic skiplist algorithm. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol.\u00a04474, pp. 124\u2013138. Springer, Heidelberg (2007)"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Concurrent Programming: Algorithms, Principles, and Foundations. Springer (2013)","DOI":"10.1007\/978-3-642-32027-9"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2013 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40047-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T01:07:54Z","timestamp":1587344874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40047-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400469","9783642400476"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40047-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}