{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:37:11Z","timestamp":1725806231591},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662451731"},{"type":"electronic","value":"9783662451748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45174-8_20","type":"book-chapter","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T11:28:20Z","timestamp":1411990100000},"page":"288-302","source":"Crossref","is-referenced-by-count":3,"title":["Solo-Fast Universal Constructions for Deterministic Abortable Objects"],"prefix":"10.1007","author":[{"given":"Claire","family":"Capdevielle","sequence":"first","affiliation":[]},{"given":"Colette","family":"Johnen","sequence":"additional","affiliation":[]},{"given":"Alessia","family":"Milani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s004460100060","volume":"15","author":"Y. Afek","year":"2002","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long lived adaptive splitter and applications. Distributed Computing\u00a015(2), 67\u201386 (2002)","journal-title":"Distributed Computing"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Frolund, S., Hadzilacos, V., Horn, S.L., Toueg, S.: Abortable and query-abortable objects and their efficient implementation. In: The 26th ACM Symposium on Principles of Distributed Computing (PODC 2007), pp. 23\u201332 (2007)","DOI":"10.1145\/1281100.1281107"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P.: The complexity of obstruction-free implementations. J. ACM\u00a056(4), 24:1\u201324:33 (2009)","DOI":"10.1145\/1538902.1538908"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Capdevielle, C., Johnen, C., Alessia, M.: Solo-fast universal constructions for deterministic abortable objects. Tech. Rep. 1480-14. LaBRI, Univ. de Bordeaux, France (May 2014), \n                    \n                      http:\/\/labri.fr\/~johnen\/","DOI":"10.1007\/978-3-662-45174-8_20"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Chuong, P., Ellen, F., Ramachandran, V.: A universal construction for wait-free transaction friendly data structures. In: The 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 335\u2013344 (2010)","DOI":"10.1145\/1810479.1810538"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.tcs.2012.09.011","volume":"496","author":"T. Crain","year":"2013","unstructured":"Crain, T., Imbs, D., Raynal, M.: Towards a universal construction for transaction-based multiprocess programs. Theor. Comput. Sci.\u00a0496, 154\u2013169 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"20_CR7","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/290179.290183","volume":"45","author":"F. Fich","year":"1998","unstructured":"Fich, F., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. J. ACM\u00a045(5), 843\u2013862 (1998)","journal-title":"J. ACM"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: The semantics of progress in lock-based transactional memory. In: The 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2009), pp. 404\u2013415 (2009)","DOI":"10.1145\/1480881.1480931"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Hadzilacos, V., Toueg, S.: On deterministic abortable objects. In: The 2013 ACM Symposium on Principles of Distributed Computing (PODC 2013), pp. 4\u201312 (2013)","DOI":"10.1145\/2484239.2484241"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst.\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"20_CR11","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: The 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp. 522\u2013529 (2003)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: The 20th Annual International Symposium on Computer Architecture (ISCA 1993), pp. 289\u2013300 (1993)","DOI":"10.1145\/173682.165164"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1137\/S0097539797317299","volume":"30","author":"P. Jayanti","year":"2000","unstructured":"Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM J. Comput.\u00a030(2), 438\u2013456 (2000)","journal-title":"SIAM J. Comput."},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-39989-6_4","volume-title":"Distributed Computing","author":"V. Luchangco","year":"2003","unstructured":"Luchangco, V., Moir, M., Shavit, N.N.: On the uncontended complexity of consensus. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 45\u201359. Springer, Heidelberg (2003)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Perelman, D., Fan, R., Keidar, I.: On maintaining multiple versions in STM. In: The 29th ACM Symposium on Principles of Distributed Computing (PODC 2010), pp. 16\u201325 (2010)","DOI":"10.1145\/1835698.1835704"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45174-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T21:00:17Z","timestamp":1558990817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45174-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662451731","9783662451748"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45174-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}