{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T00:01:36Z","timestamp":1755993696489,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T00:00:00Z","timestamp":1704326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["CRG\/2022\/009391"],"award-info":[{"award-number":["CRG\/2022\/009391"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Supercomputing Mission","award":["DST\/NSM\/R&D_Exascale\/2021\/16"],"award-info":[{"award-number":["DST\/NSM\/R&D_Exascale\/2021\/16"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,1,4]]},"DOI":"10.1145\/3631461.3632510","type":"proceedings-article","created":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T18:08:30Z","timestamp":1705946910000},"page":"258-259","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Concurrent Lock-Free Dynamic Graphs with wait-free snapshots using versioning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2342-3933","authenticated-orcid":false,"given":"Gaurav","family":"Bhardwaj","sequence":"first","affiliation":[{"name":"Computer Science and Engineering, Indian Institute of Technology Hyderabad, India, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5413-2098","authenticated-orcid":false,"given":"Ayaz","family":"Ahmed","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Indian Institute of Technology Hyderabad, India, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3471-7929","authenticated-orcid":false,"given":"Sathya","family":"Peri","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Indian Institute of Technology Hyderabad, India, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,1,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Brief Announcement: Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot. In International Symposium on Stabilizing, Safety, and Security of Distributed Systems. Springer, 106\u2013110","author":"Bhardwaj Gaurav","year":"2023","unstructured":"Gaurav Bhardwaj, Sathya Peri, and Pratik Shetty. 2023. Brief Announcement: Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot. In International Symposium on Stabilizing, Safety, and Security of Distributed Systems. Springer, 106\u2013110."},{"key":"e_1_3_2_1_2_1","unstructured":"Bapi Chatterjee Sathya Peri Muktikanta Sa and Komma Manogna. 2021. Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. In OPODIS."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3288599.3288617"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Bapi Chatterjee Ivan Walulya and Philippas Tsigas. 2016. Help-optimal and Language-portable Lock-free Concurrent Data Structures. In ICPP. 360\u2013369.","DOI":"10.1109\/ICPP.2016.48"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Timothy\u00a0L. Harris. 2001. A Pragmatic Implementation of Non-blocking Linked-Lists. In DISC. 300\u2013314.","DOI":"10.1007\/3-540-45414-4_21"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.08.011"},{"key":"e_1_3_2_1_7_1","unstructured":"Maurice Herlihy Victor Luchangco and Mark Moir. 2003. Obstruction-Free Synchronization: Double-Ended Queues as an Example. In (ICDCS. 522\u2013529."},{"key":"e_1_3_2_1_8_1","volume-title":"Kallimanis and Eleni Kanellou","author":"D.","year":"2015","unstructured":"Nikolaos\u00a0D. Kallimanis and Eleni Kanellou. 2015. Wait-Free Concurrent Graph Objects with Dynamic Traversals. In OPODIS. 1\u201327."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Yujie Liu Kunlong Zhang and Michael Spear. 2014. Dynamic-sized Nonblocking Hash Tables. In PODC. 242\u2013251.","DOI":"10.1145\/2611462.2611495"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Jacob Nelson Ahmed Hassan and Roberto Palmieri. 2021. Bundled references: an abstraction for highly-concurrent linearizable range queries. In PPOPP. 448\u2013450.","DOI":"10.1145\/3437801.3441614"},{"key":"e_1_3_2_1_11_1","volume-title":"Lock-Free Data-Structure Iterators. In International Symposium on Distributed Computing.","author":"Petrank Erez","year":"2013","unstructured":"Erez Petrank and Shahar Timnat. 2013. Lock-Free Data-Structure Iterators. In International Symposium on Distributed Computing."},{"key":"e_1_3_2_1_12_1","volume-title":"Constant-time snapshots with applications to concurrent data structures. PPOPP","author":"Wei Yuanhao","year":"2021","unstructured":"Yuanhao Wei, Naama Ben-David, Guy\u00a0E. Blelloch, Panagiota Fatourou, Eric Ruppert, and Yihan Sun. 2021. Constant-time snapshots with applications to concurrent data structures. PPOPP (2021)."}],"event":{"name":"ICDCN '24: International Conference on Distributed Computing and Networking","acronym":"ICDCN '24","location":"Chennai India"},"container-title":["Proceedings of the 25th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3631461.3632510","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3631461.3632510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:39:58Z","timestamp":1755909598000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3631461.3632510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,4]]},"references-count":12,"alternative-id":["10.1145\/3631461.3632510","10.1145\/3631461"],"URL":"https:\/\/doi.org\/10.1145\/3631461.3632510","relation":{},"subject":[],"published":{"date-parts":[[2024,1,4]]},"assertion":[{"value":"2024-01-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}