{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:31Z","timestamp":1759638211042},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,5,8]],"date-time":"2007-05-08T00:00:00Z","timestamp":1178582400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2007,10,23]]},"DOI":"10.1007\/s00446-007-0023-3","type":"journal-article","created":{"date-parts":[[2007,5,7]],"date-time":"2007-05-07T06:02:25Z","timestamp":1178517745000},"page":"239-252","source":"Crossref","is-referenced-by-count":17,"title":["Common2 extended to stacks and unbounded concurrency"],"prefix":"10.1007","volume":"20","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Morrison","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,5,8]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E., Tromp, J., Vit\u00e1nyi, P.M.B.: Wait-free TAS. In: Proceedings of WDAG. Lecture Notes in Computer Science, vol. 647, pp. 85\u201394 (1992)","DOI":"10.1007\/3-540-56188-9_6"},{"issue":"1","key":"23_CR2","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1006\/jagm.1998.0969","volume":"30","author":"Y. Afek","year":"1999","unstructured":"Afek Y. and Weisberger E. (1999). The instancy of snapshots and commuting objects. J Algorithms 30(1): 68\u2013105","journal-title":"J Algorithms"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Afek, Y., Weisberger, E., Weisman, H.: A completeness theorem for a class of synchronization objects. In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 159\u2013170 (1993)","DOI":"10.1145\/164051.164071"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming.In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41\u201351 (1993)","DOI":"10.1145\/164051.164056"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"David, M.: A single-enqueuer wait-free queue implementation. In: Proceedings of DISC 2004. Lecture Notes in Computer Science, vol. 3274, pp. 132\u2013143 (2004)","DOI":"10.1007\/978-3-540-30186-8_10"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"David, M.: Alex Brodsky and faith Ellen Fich. Restricted stack implementations. In: Proceedings of DISC 2005. Lecture Notes in Computer Science, vol. 3724, pp. 137\u2013151 (2005)","DOI":"10.1007\/11561927_12"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Gafni, E.: A simple algorithmic characterization of uniform solvability. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), pp. 228\u2013237 (2002)","DOI":"10.1109\/SFCS.2002.1181946"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency. In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC 2001) (2001)","DOI":"10.1145\/383962.384008"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. In: Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), pp. 206\u2013215 (2004)","DOI":"10.1145\/1007912.1007944"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Herlihy, M.: Impossibility results for asynchronous PRAM. In: Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures (SPAA), pp. 327\u2013336 (1991)","DOI":"10.1145\/113379.113409"},{"issue":"1","key":"23_CR11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy M. (1991). Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1): 124\u2013149","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"6","key":"23_CR12","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy M. and Shavit N. (1999). The topological structure of asynchronous computability. J. ACM 46(6): 858\u2013923","journal-title":"J. ACM"},{"issue":"3","key":"23_CR13","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy M. and Wing J. (1990). Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3): 463\u2013492","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"23_CR14","unstructured":"Li, Z.: Non-blocking implementations of queues in asynchronous distributed shared-memory systems. Master\u2019s thesis, Department of Computer Science, University of Toronto (2001)"},{"key":"23_CR15","unstructured":"Scott McCrickard, D.A.: Study of wait-free hierarchies in concurrent systems. Technical report GIT-CC-94-94"},{"key":"23_CR16","unstructured":"Weisman, H.: Implementing shared memory overwriting objects. Master\u2019s thesis, School of Computer Science, Tel-Aviv University"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0023-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-007-0023-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0023-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:26:36Z","timestamp":1559121996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-007-0023-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,8]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,10,23]]}},"alternative-id":["23"],"URL":"https:\/\/doi.org\/10.1007\/s00446-007-0023-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,8]]}}}