{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:34:45Z","timestamp":1781217285496,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100015301","name":"Office of Science","doi-asserted-by":"publisher","award":["DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-AC02-05CH11231"]}],"id":[{"id":"10.13039\/100015301","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400244","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"555-557","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Towards Lockfree Persistent Homology"],"prefix":"10.1145","author":[{"given":"Dmitriy","family":"Morozov","sequence":"first","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnur","family":"Nigmetov","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"August","author":"Bauer U.","year":"2019","unstructured":"U. Bauer . Ripser: efficient computation of Vietoris-Rips persistence barcodes , August 2019 . arXiv:1908.02518. U. Bauer. Ripser: efficient computation of Vietoris-Rips persistence barcodes, August 2019. arXiv:1908.02518."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973198.4"},{"key":"e_1_3_2_1_3_1","volume-title":"Phat--persistent homology algorithms toolbox. Journal of symbolic computation, 78:76--90","author":"Bauer U.","year":"2017","unstructured":"U. Bauer , M. Kerber , J. Reininghaus , and H. Wagner . Phat--persistent homology algorithms toolbox. Journal of symbolic computation, 78:76--90 , 2017 . U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner. Phat--persistent homology algorithms toolbox. Journal of symbolic computation, 78:76--90, 2017."},{"key":"e_1_3_2_1_4_1","first-page":"197","volume-title":"Proceedings 27th European Workshop on Computational Geometry","volume":"11","author":"Chen C.","year":"2011","unstructured":"C. Chen and M. Kerber . Persistent homology computation with a twist . In Proceedings 27th European Workshop on Computational Geometry , volume 11 , pages 197 -- 200 , 2011 . C. Chen and M. Kerber. Persistent homology computation with a twist. In Proceedings 27th European Workshop on Computational Geometry, volume 11, pages 197--200, 2011."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137877"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/12\/124003"},{"key":"e_1_3_2_1_7_1","volume-title":"American Mathematical Soc.","author":"Edelsbrunner H.","year":"2010","unstructured":"H. Edelsbrunner and J. Harer . Computational topology: an introduction . American Mathematical Soc. , 2010 . H. Edelsbrunner and J. Harer. Computational topology: an introduction. American Mathematical Soc., 2010."},{"key":"e_1_3_2_1_8_1","volume-title":"Jacob E Goodman, Joseph O'Rourke, and Csaba D T\u00f3th","author":"Edelsbrunner H.","year":"2017","unstructured":"H. Edelsbrunner and D. Morozov . Persistent homology . In Jacob E Goodman, Joseph O'Rourke, and Csaba D T\u00f3th , editors, Handbook of Discrete and Computational Geometry. CRC Press , 2017 . H. Edelsbrunner and D. Morozov. Persistent homology. In Jacob E Goodman, Joseph O'Rourke, and Csaba D T\u00f3th, editors, Handbook of Discrete and Computational Geometry. CRC Press, 2017."},{"key":"e_1_3_2_1_9_1","volume-title":"November","author":"Edelsbrunner H.","year":"2002","unstructured":"H. Edelsbrunner , D. Letscher , and A. Zomorodian . Topological persistence and simplification. Discrete & computational geometry, 28(4):511--533 , November 2002 . H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. Discrete & computational geometry, 28(4):511--533, November 2002."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755587"},{"key":"e_1_3_2_1_11_1","volume-title":"July","author":"Lewis R.","year":"2014","unstructured":"R. Lewis and A. Zomorodian . Multicore homology via mayer vietoris , July 2014 . arXiv:1407.2275. R. Lewis and A. Zomorodian. Multicore homology via mayer vietoris, July 2014. arXiv:1407.2275."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjds\/s13688-017-0109-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3330345.3332147"},{"key":"e_1_3_2_1_14_1","volume-title":"GPU-Accelerated computation of Vietoris-Rips persistence barcodes","author":"Zhang S.","year":"2020","unstructured":"S. Zhang , M. Xiao , and H. Wang . GPU-Accelerated computation of Vietoris-Rips persistence barcodes . March 2020 . S. Zhang, M. Xiao, and H. Wang. GPU-Accelerated computation of Vietoris-Rips persistence barcodes. March 2020."}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","location":"Virtual Event USA","acronym":"SPAA '20","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":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400244","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:35Z","timestamp":1750202015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":14,"alternative-id":["10.1145\/3350755.3400244","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400244","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}