{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T08:29:19Z","timestamp":1768811359941,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:00:00Z","timestamp":1673481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:00:00Z","timestamp":1673481600000},"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":["Distrib. Comput."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s00446-022-00441-x","type":"journal-article","created":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T18:02:44Z","timestamp":1673546564000},"page":"395-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The splay-list: a distribution-adaptive concurrent skip-list"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9134-5490","authenticated-orcid":false,"given":"Vitaly","family":"Aksenov","sequence":"first","affiliation":[]},{"given":"Dan","family":"Alistarh","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Drozdova","sequence":"additional","affiliation":[]},{"given":"Amirkeivan","family":"Mohtashami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,12]]},"reference":[{"key":"441_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Kaplan, H., Korenfeld, B., Morrison, A., Tarjan, R.\u00a0E.: Cbtree: A practical concurrent self-adjusting search tree. In Proceedings of the 26th International Conference on Distributed Computing, DISC\u201912, pages 1\u201315, Berlin, Heidelberg. Springer-Verlag (2012)","DOI":"10.1007\/978-3-642-33651-5_1"},{"key":"441_CR2","unstructured":"Arbel-Raviv, M., Brown, T., Morrison, A.: Getting to the root of concurrent binary search tree performance. In 2018 USENIX Annual Technical Conference (USENIX ATC 18), pages 295\u2013306, Boston, MA, July 2018. USENIX Association"},{"issue":"1","key":"441_CR3","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(1), 31\u201348 (2005)","journal-title":"Algorithmica"},{"key":"441_CR4","unstructured":"Bose, P., Dou\u00efeb, K., Langerman, S.: Dynamic optimality for skip lists and b-trees. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1106\u20131114 (2008)"},{"key":"441_CR5","unstructured":"Brown, T.: Techniques for Constructing Efficient Data Structures. PhD thesis, PhD thesis, University of Toronto (2017)"},{"key":"441_CR6","doi-asserted-by":"crossref","unstructured":"Ciriani, V., Ferragina, P., Luccio, F., Muthukrishnan, S.: Static optimality theorem for external memory string access. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 219\u2013227. IEEE (2002)","DOI":"10.1109\/SFCS.2002.1181945"},{"key":"441_CR7","doi-asserted-by":"crossref","unstructured":"Cooper, B.\u00a0F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with ycsb. In Proceedings of the 1st ACM Symposium on Cloud Computing, 143\u2013154 (2010)","DOI":"10.1145\/1807128.1807152"},{"key":"441_CR8","unstructured":"Correia, A., Ramalhete, P.: Scalable reader-writer lock in c++1x. http:\/\/concurrencyfreaks.blogspot.com\/2015\/01\/scalable-reader-writer-lock-in-c1x.html (2015)"},{"key":"441_CR9","doi-asserted-by":"crossref","unstructured":"Ellen, F., Fatourou, P., Ruppert, E., Breugel, F. van: Non-blocking binary search trees. In Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC \u201910, pages 131\u2013140, New York, NY, USA. ACM (2010)","DOI":"10.1145\/1835698.1835736"},{"key":"441_CR10","unstructured":"Fraser, K.: Practical lock-freedom. Technical Report UCAM-CL-TR-579, University of Cambridge, Computer Laboratory, February (2004)"},{"key":"441_CR11","unstructured":"Fraser, K.: Practical lock-freedom. PhD thesis, PhD thesis, Cambridge University Computer Laboratory, 2003. Also available as Technical Report UCAM-CL-TR-579 (2004)"},{"key":"441_CR12","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Lev, Y., Luchangco, V., Shavit, N.: A simple optimistic skiplist algorithm. In Proceedings of the 14th International Conference on Structural Information and Communication Complexity, SIROCCO\u201907, pages 124\u2013138, Berlin, Heidelberg. Springer-Verlag (2007)","DOI":"10.1007\/978-3-540-72951-8_11"},{"key":"441_CR13","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)"},{"key":"441_CR14","unstructured":"Iacono, J.: Alternatives to splay trees with o (log n) worst-case access times. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 516\u2013522. Society for Industrial and Applied Mathematics (2001)"},{"key":"441_CR15","volume-title":"The art of computer programming","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The art of computer programming, vol. 3. Pearson Education, London (1997)"},{"key":"441_CR16","unstructured":"Lea, D.: (2007) http:\/\/java.sun.com\/javase\/6\/docs\/api\/java\/util\/concurrent\/ConcurrentSkipListMap.html"},{"issue":"3","key":"441_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0020-0190(91)90235-A","volume":"38","author":"C Martel","year":"1991","unstructured":"Martel, C.: Self-adjusting multi-way search trees. Inf. Process. Lett. 38(3), 135\u2013141 (1991)","journal-title":"Inf. Process. Lett."},{"key":"441_CR18","doi-asserted-by":"crossref","unstructured":"Michael, M.\u00a0M: High performance dynamic lock-free hash tables and list-based sets. In Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 73\u201382. ACM (2002)","DOI":"10.1145\/564870.564881"},{"key":"441_CR19","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, PPoPP \u201914, pages 317\u2013328, New York, NY, USA. ACM (2014)","DOI":"10.1145\/2555243.2555256"},{"issue":"4","key":"441_CR20","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/369275.369291","volume":"29","author":"Meikel Poess","year":"2000","unstructured":"Poess, Meikel, Floyd, Chris: New tpc benchmarks for decision support and web commerce. ACM Sigmod Rec. 29(4), 64\u201371 (2000)","journal-title":"ACM Sigmod Rec."},{"key":"441_CR21","unstructured":"Pugh, W.: Concurrent maintenance of skip lists. (1998)"},{"issue":"3","key":"441_CR22","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 (JACM) 32(3), 652\u2013686 (1985)","journal-title":"J. ACM (JACM)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00441-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-022-00441-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00441-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T03:39:28Z","timestamp":1728704368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-022-00441-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,12]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["441"],"URL":"https:\/\/doi.org\/10.1007\/s00446-022-00441-x","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,12]]},"assertion":[{"value":"15 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}