{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T17:05:11Z","timestamp":1751648711333,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210661","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"355-358","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Manuel","family":"P\u00f6ter","sequence":"first","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]},{"given":"Jesper Larsson","family":"Tr\u00e4ff","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_1_2_1","unstructured":"Keir Fraser. 2004. Practical lock-freedom. Ph.D. Dissertation. University of Cambridge Computer Laboratory.  Keir Fraser. 2004. Practical lock-freedom. Ph.D. Dissertation. University of Cambridge Computer Laboratory."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_5_1","unstructured":"Manuel P\u00f6ter. 2018. Effective Memory Reclamation for Lock-Free Data Structures in C++. Master's thesis. TU Wien Vienna Austria.  Manuel P\u00f6ter. 2018. Effective Memory Reclamation for Lock-Free Data Structures in C++. Master's thesis. TU Wien Vienna Austria."},{"key":"e_1_3_2_1_6_1","unstructured":"Manuel P\u00f6ter and Jesper Larsson Tr\u00e4ff. 2017. A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it). (2017). arXiv:1712.06134.  Manuel P\u00f6ter and Jesper Larsson Tr\u00e4ff. 2017. A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it). (2017). arXiv:1712.06134."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178532"},{"volume-title":"Stamp-it: A more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model.","year":"2018","author":"P\u00f6ter Manuel","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","unstructured":"Arch D. Robison. 2013. Policy-Based Design for Safe Destruction in Concurrent Containers. C++ standards committee paper http:\/\/www.open-std.org\/jtc1\/sc22\/ wg21\/docs\/papers\/2013\/n3712.pdf. (2013).  Arch D. Robison. 2013. Policy-Based Design for Safe Destruction in Concurrent Containers. C++ standards committee paper http:\/\/www.open-std.org\/jtc1\/sc22\/ wg21\/docs\/papers\/2013\/n3712.pdf. (2013)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.03.001"},{"key":"e_1_3_2_1_11_1","unstructured":"John D. Valois. 1995. Lock-Free Data Structures. Ph.D. Dissertation. Rensselaer Polytechnic Institute.   John D. Valois. 1995. Lock-Free Data Structures. Ph.D. Dissertation. Rensselaer Polytechnic Institute."}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","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"],"location":"Vienna Austria","acronym":"SPAA '18"},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210661","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:20Z","timestamp":1750210760000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210661"}},"subtitle":["Stamp-it, a more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model"],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":11,"alternative-id":["10.1145\/3210377.3210661","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210661","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}