{"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":1779174794978,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1901381, CCF-1910030, and CCF-1919223"],"award-info":[{"award-number":["CCF-1901381, CCF-1910030, and CCF-1919223"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,2,17]]},"DOI":"10.1145\/3437801.3441602","type":"proceedings-article","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T23:04:20Z","timestamp":1613862260000},"page":"31-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Constant-time snapshots with applications to concurrent data structures"],"prefix":"10.1145","author":[{"given":"Yuanhao","family":"Wei","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naama","family":"Ben-David","sequence":"additional","affiliation":[{"name":"VMware Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiota","family":"Fatourou","sequence":"additional","affiliation":[{"name":"FORTH ICS and University of Crete, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Ruppert","sequence":"additional","affiliation":[{"name":"York University, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihan","family":"Sun","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/153724.153741"},{"key":"e_1_3_2_1_2_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 . 2017. Linearizable Iterators for Concurrent Data Structures. CoRR abs\/1705.08885 ( 2017 ). arXiv:1705.08885 http:\/\/arxiv.org\/abs\/1705.08885 Archita Agarwal, Zhiyu Liu, Eli Rosenthal, and Vikram Saraph. 2017. Linearizable Iterators for Concurrent Data Structures. CoRR abs\/1705.08885 (2017). arXiv:1705.08885 http:\/\/arxiv.org\/abs\/1705.08885"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02280833"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178489"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378591"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484254"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3399718"},{"key":"e_1_3_2_1_8_1","volume-title":"Multiversion Concurrency with Bounded Delay and Precise Garbage Collection. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 241--252","author":"Ben-David Naama","year":"2019","unstructured":"Naama Ben-David , Guy E. Blelloch , Yihan Sun , and Yuanhao Wei . 2019 . Multiversion Concurrency with Bounded Delay and Precise Garbage Collection. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 241--252 . Naama Ben-David, Guy E. Blelloch, Yihan Sun, and Yuanhao Wei. 2019. Multiversion Concurrency with Bounded Delay and Precise Garbage Collection. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 241--252."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/319996.319998"},{"key":"e_1_3_2_1_10_1","volume-title":"Just Join for Parallel Ordered Sets. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 253--264","author":"Blelloch Guy E.","year":"2016","unstructured":"Guy E. Blelloch , Daniel Ferizovic , and Yihan Sun . 2016 . Just Join for Parallel Ordered Sets. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 253--264 . Guy E. Blelloch, Daniel Ferizovic, and Yihan Sun. 2016. Just Join for Parallel Ordered Sets. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 253--264."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011778"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693488"},{"key":"e_1_3_2_1_13_1","unstructured":"Trevor Brown. [n.d.]. Java Lock-Free Data Structure Library. Available from https:\/\/bitbucket.org\/trbot86\/implementations\/src\/master\/java.  Trevor Brown. [n.d.]. Java Lock-Free Data Structure Library. Available from https:\/\/bitbucket.org\/trbot86\/implementations\/src\/master\/java."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35476-2_3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555267"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.05.009"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3007748.3007771"},{"key":"e_1_3_2_1_19_1","unstructured":"Cplusplus.com. [n.d.]. Documentation for std::find_if. http:\/\/www.cplusplus.com\/reference\/algorithm\/findif\/ accessed 31 December 2020.  Cplusplus.com. [n.d.]. Documentation for std::find_if. http:\/\/www.cplusplus.com\/reference\/algorithm\/findif\/ accessed 31 December 2020."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_3_2_1_21_1","unstructured":"Thomas Dickerson. 2020. Adapting Persistent Data Structures for Concurrency and Speculation. arXiv:2003.07395 [cs.DC]  Thomas Dickerson. 2020. Adapting Persistent Data Structures for Concurrency and Speculation. arXiv:2003.07395 [cs.DC]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2775435"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90034-2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/185675.185791"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281108"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626417500013"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323197"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941579"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30577-4_3"},{"key":"e_1_3_2_1_31_1","volume-title":"Technical Report","author":"Fraser Keir","unstructured":"Keir Fraser . 2004. Practical Lock-freedom. Technical Report . University of Cambridge , Computer Laboratory . Keir Fraser. 2004. Practical Lock-freedom. Technical Report. University of Cambridge, Computer Laboratory."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45414-4_21"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.08.005"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571875"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060697"},{"key":"e_1_3_2_1_37_1","volume-title":"Proc. 19th International Conference on Principles of Distributed Systems (Leibniz International Proceedings in Informatics).","author":"Nikolaos","unstructured":"Nikolaos D. Kallimanis and Eleni Kanellou. 2015. Wait-free Concurrent Graph Objects with Dynamic Traversals . In Proc. 19th International Conference on Principles of Distributed Systems (Leibniz International Proceedings in Informatics). Nikolaos D. Kallimanis and Eleni Kanellou. 2015. Wait-free Concurrent Graph Objects with Dynamic Traversals. In Proc. 19th International Conference on Principles of Distributed Systems (Leibniz International Proceedings in Informatics)."},{"key":"e_1_3_2_1_38_1","volume-title":"Intl Conf. on Dist. Computing and Networking. 212--226","author":"Kumar Priyanka","unstructured":"Priyanka Kumar , Sathya Peri , and K. Vidyasankar . 2014. A TimeStamp Based Multi-version STM Algorithm . In Intl Conf. on Dist. Computing and Networking. 212--226 . Priyanka Kumar, Sathya Peri, and K. Vidyasankar. 2014. A TimeStamp Based Multi-version STM Algorithm. In Intl Conf. on Dist. Computing and Networking. 212--226."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_3_2_1_40_1","volume-title":"Fast Serializable Multi-version Concurrency Control for Main-Memory Database Systems. In ACM SIGMOD International Conference on Management of Data (SIGMOD). 677--689","author":"Neumann Thomas","year":"2015","unstructured":"Thomas Neumann , Tobias M\u00fchlbauer , and Alfons Kemper . 2015 . Fast Serializable Multi-version Concurrency Control for Main-Memory Database Systems. In ACM SIGMOD International Conference on Management of Data (SIGMOD). 677--689 . Thomas Neumann, Tobias M\u00fchlbauer, and Alfons Kemper. 2015. Fast Serializable Multi-version Concurrency Control for Main-Memory Database Systems. In ACM SIGMOD International Conference on Management of Data (SIGMOD). 677--689."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.84"},{"key":"e_1_3_2_1_42_1","volume-title":"Algorithms, Probability, Networks and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occassion of his 60th Birthday","author":"Nikolakopoulos Yiannis","unstructured":"Yiannis Nikolakopoulos , Anders Gidenstam , Marina Papatriantafilou , and Philippas Tsigas . 2015. Of Concurrent Data Structures and Iterations . In Algorithms, Probability, Networks and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occassion of his 60th Birthday . Springer , 358--369. Yiannis Nikolakopoulos, Anders Gidenstam, Marina Papatriantafilou, and Philippas Tsigas. 2015. Of Concurrent Data Structures and Iterations. In Algorithms, Probability, Networks and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occassion of his 60th Birthday. Springer, 358--369."},{"key":"e_1_3_2_1_43_1","volume-title":"Java Weakly Consistent Iterators. https:\/\/docs.oracle.com\/javase\/8\/docs\/api\/java\/util\/concurrent\/package-summary.html #Weakly accessed","year":"2020","unstructured":"Oracle. [n.d.]. Java Weakly Consistent Iterators. https:\/\/docs.oracle.com\/javase\/8\/docs\/api\/java\/util\/concurrent\/package-summary.html #Weakly accessed 31 December 2020 . Oracle. [n.d.]. Java Weakly Consistent Iterators. https:\/\/docs.oracle.com\/javase\/8\/docs\/api\/java\/util\/concurrent\/package-summary.html #Weakly accessed 31 December 2020."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/348.318588"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24100-0_9"},{"key":"e_1_3_2_1_46_1","volume-title":"On Maintaining Multiple Versions in STM. In ACM Symp. on Principles of Dist. Computing. 16--25","author":"Perelman Dmitri","year":"2010","unstructured":"Dmitri Perelman , Rui Fan , and Idit Keidar . 2010 . On Maintaining Multiple Versions in STM. In ACM Symp. on Principles of Dist. Computing. 16--25 . Dmitri Perelman, Rui Fan, and Idit Keidar. 2010. On Maintaining Multiple Versions in STM. In ACM Symp. on Principles of Dist. Computing. 16--25."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-216"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367523"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2774975.2774976"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145836"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_20"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/6138.6151"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364334"},{"key":"e_1_3_2_1_55_1","volume-title":"PAM: Parallel Augmented Maps. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP). 290--304","author":"Sun Yihan","unstructured":"Yihan Sun , Daniel Ferizovic , and Guy E. Blelloch . 2018 . PAM: Parallel Augmented Maps. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP). 290--304 . Yihan Sun, Daniel Ferizovic, and Guy E. Blelloch. 2018. PAM: Parallel Augmented Maps. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP). 290--304."},{"key":"e_1_3_2_1_56_1","unstructured":"Yuanhao Wei Naama Ben-David Guy E. Blelloch Panagiota Fatourou Eric Ruppert and Yihan Sun. 2020. Constant-Time Snapshots with Applications to Concurrent Data Structures. arXiv:2007.02372 [cs.DC]  Yuanhao Wei Naama Ben-David Guy E. Blelloch Panagiota Fatourou Eric Ruppert and Yihan Sun. 2020. Constant-Time Snapshots with Applications to Concurrent Data Structures. arXiv:2007.02372 [cs.DC]"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210413"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067427"}],"event":{"name":"PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Virtual Event Republic of Korea","acronym":"PPoPP '21","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441602","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437801.3441602","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437801.3441602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:25Z","timestamp":1750191445000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,17]]},"references-count":56,"alternative-id":["10.1145\/3437801.3441602","10.1145\/3437801"],"URL":"https:\/\/doi.org\/10.1145\/3437801.3441602","relation":{},"subject":[],"published":{"date-parts":[[2021,2,17]]},"assertion":[{"value":"2021-02-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}