{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:14Z","timestamp":1779174794953,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["754337"],"award-info":[{"award-number":["754337"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323197","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"275-286","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries"],"prefix":"10.1145","author":[{"given":"Panagiota","family":"Fatourou","sequence":"first","affiliation":[{"name":"Foundation of Research and Technology-Hellas (FORTH) & University of Crete, Heraklion, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elias","family":"Papavasileiou","sequence":"additional","affiliation":[{"name":"University of Crete, Heraklion, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Ruppert","sequence":"additional","affiliation":[{"name":"York University, Toronto, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Linearizable iterators for concurrent data structures. CoRR, abs\/1705.08885","author":"Agarwal Archita","year":"2017","unstructured":"Archita Agarwal , Zhiyu Liu , Eli Rosenthal , and Vikram Saraph . Linearizable iterators for concurrent data structures. CoRR, abs\/1705.08885 , 2017 . URL : http:\/\/arxiv.org\/abs\/1705.08885,arXiv:1705.08885. Archita Agarwal, Zhiyu Liu, Eli Rosenthal, and Vikram Saraph. Linearizable iterators for concurrent data structures. CoRR, abs\/1705.08885, 2017. URL: http:\/\/arxiv.org\/abs\/1705.08885,arXiv:1705.08885."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178489"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378591"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484254"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018761"},{"key":"e_1_3_2_1_6_1","volume-title":"Inc.","author":"Bernstein Philip A.","year":"1987","unstructured":"Philip A. Bernstein , Vassos Hadzilacos , and Nathan Goodman . Concurrency Control and Recovery in Database Systems. Addison-Wesley Longman Publishing Co ., Inc. , Boston, MA, USA , 1987 . Philip A. Bernstein, Vassos Hadzilacos, and Nathan Goodman.Concurrency Control and Recovery in Database Systems. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1987."},{"key":"e_1_3_2_1_7_1","first-page":"58","volume-title":"Proc. 24th ACM Symposium on Parallelism in Algorithms and Architectures","author":"Braginsky Anastasia","year":"2012","unstructured":"Anastasia Braginsky and Erez Petrank . A lock-free B+tree. In Proc. 24th ACM Symposium on Parallelism in Algorithms and Architectures , pages 58 -- 67 , 2012 . Anastasia Braginsky and Erez Petrank. A lock-free B+tree. In Proc. 24th ACM Symposium on Parallelism in Algorithms and Architectures, pages 58--67, 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693488"},{"key":"e_1_3_2_1_9_1","unstructured":"Trevor Brown. URL: https:\/\/bitbucket.org\/trbot86\/implementations\/src\/.  Trevor Brown. URL: https:\/\/bitbucket.org\/trbot86\/implementations\/src\/."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35476-2_3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484273"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555267"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3007748.3007771"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611500"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0465-6"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90034-2"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611486"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835736"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626417500013"},{"key":"e_1_3_2_1_22_1","volume-title":"Persistent non-blocking binary searchtrees supporting wait-free range queries. Technical report","author":"Fatourou Panagiota","year":"2018","unstructured":"Panagiota Fatourou and Eric Ruppert . Persistent non-blocking binary searchtrees supporting wait-free range queries. Technical report , 2018 . Available at https:\/\/zenodo.org\/record\/1245968#.WvdbUrjSn98. Updated version available at http:\/\/arxiv.org\/abs\/1805.04779. Panagiota Fatourou and Eric Ruppert. Persistent non-blocking binary searchtrees supporting wait-free range queries. Technical report, 2018. Available at https:\/\/zenodo.org\/record\/1245968#.WvdbUrjSn98. Updated version available at http:\/\/arxiv.org\/abs\/1805.04779."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_26_1","first-page":"522","volume-title":"Proc. 23rd International Conference on Distributed Computing Systems","author":"Herlihy Maurice","year":"2003","unstructured":"Maurice Herlihy , Victor Luchangco , and Mark Moir . Obstruction-free synchronization : Double-ended queues as an example . In Proc. 23rd International Conference on Distributed Computing Systems , pages 522 -- 529 . IEEE, 2003 . Maurice Herlihy, Victor Luchangco, and Mark Moir. Obstruction-free synchronization: Double-ended queues as an example. In Proc. 23rd International Conference on Distributed Computing Systems, pages 522--529. IEEE, 2003."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.139204"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_30_1","first-page":"161","volume-title":"Proc. 24th ACM Symposium on Parallelism in Algorithms and Architectures","author":"Shane","year":"2012","unstructured":"Shane V. Howley and Jeremy Jones. A non-blocking internal binary search tree . In Proc. 24th ACM Symposium on Parallelism in Algorithms and Architectures , pages 161 -- 171 , 2012 . Shane V. Howley and Jeremy Jones. A non-blocking internal binary search tree. In Proc. 24th ACM Symposium on Parallelism in Algorithms and Architectures, pages 161--171, 2012."},{"key":"e_1_3_2_1_31_1","unstructured":"Intel Threading Building Blocks documentation. URL: https:\/\/www.threadingbuildingblocks.org\/docs\/help\/reference\/containers_overview.  Intel Threading Building Blocks documentation. URL: https:\/\/www.threadingbuildingblocks.org\/docs\/help\/reference\/containers_overview."},{"key":"e_1_3_2_1_32_1","unstructured":"Java Platform Standard Edition 7 documentation. URL: http:\/\/docs.oracle.com\/javase\/7\/docs\/index.html.  Java Platform Standard Edition 7 documentation. URL: http:\/\/docs.oracle.com\/javase\/7\/docs\/index.html."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060697"},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. 19th International Conference on Principles of Distributed Systems, Leibniz International Proceedings in Informatics","author":"Nikolaos","year":"2015","unstructured":"Nikolaos D. Kallimanis and Eleni Kanellou. Wait-free concurrent graph objects with dynamic traversals . In Proc. 19th International Conference on Principles of Distributed Systems, Leibniz International Proceedings in Informatics , 2015 . Nikolaos D. Kallimanis and Eleni Kanellou. Wait-free concurrent graph objects with dynamic traversals. In Proc. 19th International Conference on Principles of Distributed Systems, Leibniz International Proceedings in Informatics, 2015."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050006"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45209-6_92"},{"key":"e_1_3_2_1_38_1","first-page":"267","volume-title":"Proc. 15th ACM Symposium on Principles of Distributed Computing","author":"Maged","year":"1996","unstructured":"Maged M. Michael and Michael L. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms . In Proc. 15th ACM Symposium on Principles of Distributed Computing , pages 267 -- 275 , 1996 . Maged M. Michael and Michael L. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proc. 15th ACM Symposium on Principles of Distributed Computing, pages 267--275, 1996."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03089-0_4"},{"key":"e_1_3_2_1_41_1","unstructured":".NET framework class library documentation. URL: http:\/\/msdn.microsoft.com\/en-us\/library\/gg145045.aspx.  .NET framework class library documentation. URL: http:\/\/msdn.microsoft.com\/en-us\/library\/gg145045.aspx."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.84"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/978-3-319-24024-4_20","volume-title":"Algorithms, Probability, Networks and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of his 60th Birthday","author":"Nikolakopoulos Yiannis","year":"2015","unstructured":"Yiannis Nikolakopoulos , Anders Gidenstam , Marina Papatriantafilou , and Philippas Tsigas . Of concurrent data structures and iterations . In Algorithms, Probability, Networks and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of his 60th Birthday , pages 358 -- 369 . Springer , 2015 . Yiannis Nikolakopoulos, Anders Gidenstam, Marina Papatriantafilou, and Philippas Tsigas. Of concurrent data structures and iterations. In Algorithms, Probability, Networks and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of his 60th Birthday, pages 358--369. Springer, 2015."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814710.2814719"},{"key":"e_1_3_2_1_45_1","unstructured":"Elias Papavasileiou. URL: https:\/\/github.com\/elias-pap\/PNB-BST\/.  Elias Papavasileiou. URL: https:\/\/github.com\/elias-pap\/PNB-BST\/."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_16"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145836"},{"key":"e_1_3_2_1_48_1","unstructured":"Eli Rosenthal. Linearizable iterators. URL: https:\/\/cs.brown.edu\/research\/pubs\/theses\/masters\/2016\/rosenthal.eli.pdf .  Eli Rosenthal. Linearizable iterators. URL: https:\/\/cs.brown.edu\/research\/pubs\/theses\/masters\/2016\/rosenthal.eli.pdf ."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940876"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.43"},{"key":"e_1_3_2_1_51_1","volume-title":"Proc. 20th International Conference on Principles of Distributed Systems, Leibniz International Proceedings in Informatics","author":"Spiegelman Alexander","year":"2016","unstructured":"Alexander Spiegelman and Idit Keidar . Dynamic atomic snapshots . In Proc. 20th International Conference on Principles of Distributed Systems, Leibniz International Proceedings in Informatics , 2016 . Alexander Spiegelman and Idit Keidar. Dynamic atomic snapshots. In Proc. 20th International Conference on Principles of Distributed Systems, Leibniz International Proceedings in Informatics, 2016."},{"key":"e_1_3_2_1_52_1","first-page":"544","volume-title":"Proc. International Conference on Parallel and Distributed Systems","author":"Tsay Jyh-Jong","year":"1994","unstructured":"Jyh-Jong Tsay and H.-C. Li . Lock-free concurrent tree structures for multiprocessor systems . In Proc. International Conference on Parallel and Distributed Systems , pages 544 -- 549 , 1994 . Jyh-Jong Tsay and H.-C. Li. Lock-free concurrent tree structures for multiprocessor systems. In Proc. International Conference on Parallel and Distributed Systems, pages 544--549, 1994."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224988"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210413"}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","location":"Phoenix AZ USA","acronym":"SPAA '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323197","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323197","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":52,"alternative-id":["10.1145\/3323165.3323197","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323197","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}