{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:54Z","timestamp":1725455694598},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602743"},{"type":"electronic","value":"9783540447832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0022146","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:19:52Z","timestamp":1131862792000},"page":"168-182","source":"Crossref","is-referenced-by-count":13,"title":["Universal constructions for large objects"],"prefix":"10.1007","author":[{"given":"James H.","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Moir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"J. Anderson and M. Moir, \u201cUniversal Constructions for Multi-Object Operations\u201d, to appear in the Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, 1995.","DOI":"10.1145\/224964.224985"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"G. Barnes, \u201cA Method for Implementing Lock-Free Shared Data Structures\u201d, Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, 1993, pp. 261\u2013270.","DOI":"10.1145\/165231.165265"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"M. Herlihy, \u201cWait-Free Synchronization\u201d, ACM Transactions on Programming Languages and Systems, Vol. 13, No. 1, 1991, pp. 124\u2013149.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"5","key":"12_CR4","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/161468.161469","volume":"15","author":"M. Herlihy","year":"1993","unstructured":"M. Herlihy, \u201cA Methodology for Implementing Highly Concurrent Data Objects\u201d, ACM Transactions on Programming Languages and Systems, Vol. 15, No. 5, 1993, pp. 745\u2013770.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR5","first-page":"151","volume-title":"Disjoint-Access-Parallel Implementations of Strong Shared Memory Primitives","author":"A. Israeli","year":"1994","unstructured":"A. Israeli and L. Rappoport, \u201cDisjoint-Access-Parallel Implementations of Strong Shared Memory Primitives\u201d, Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, August 1994, pp. 151\u2013160."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"N. Shavit and D. Touitou, \u201cSoftware Transactional Memory\u201d, to appear in the Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, 1995.","DOI":"10.1145\/224964.224987"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T02:18:48Z","timestamp":1554430728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602743","9783540447832"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0022146","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}