{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T13:07:10Z","timestamp":1770296830641,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439500","type":"print"},{"value":"9783662439517","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_19","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"220-231","source":"Crossref","is-referenced-by-count":6,"title":["Between Linearizability and Quiescent Consistency"],"prefix":"10.1007","author":[{"given":"Radha","family":"Jagadeesan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Riely","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-17653-1_29","volume-title":"Principles of Distributed Systems","author":"Y. Afek","year":"2010","unstructured":"Afek, Y., Korland, G., Yanovsky, E.: Quasi-linearizability: Relaxed consistency for improved concurrency. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol.\u00a06490, pp. 395\u2013410. Springer, Heidelberg (2010)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Aiello, W., Busch, C., Herlihy, M., et al.: Supporting increment and decrementoperations in balancing networks. Chicago J. Theor. Comput. Sci. (2000)","DOI":"10.1007\/3-540-49116-3_37"},{"issue":"5","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1145\/185675.185815","volume":"41","author":"J. Aspnes","year":"1994","unstructured":"Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. J. ACM\u00a041(5), 1020\u20131048 (1994)","journal-title":"J. ACM"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Batty, M., Dodds, M., Gotsman, A.: Library abstraction for C\/C++ concurrency. In: POPL (2013)","DOI":"10.1145\/2429069.2429099"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Busch, C., Mavronicolas, M.: The strength of counting networks (abstract). In: Burns, J.E., Moses, Y. (eds.) PODC, p. 311. ACM (1996)","DOI":"10.1145\/248052.248115"},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1145\/268999.269000","volume":"44","author":"C. Dwork","year":"1997","unstructured":"Dwork, C., Herlihy, M., Waarts, O.: Contention in shared memory algorithms. J. ACM\u00a044(6), 779\u2013805 (1997)","journal-title":"J. ACM"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Haas, A., Lippautz, M., Henzinger, T.A., et al.: Distributed queues in shared memory. In: Conf. Computing Frontiers, p. 17. ACM (2013)","DOI":"10.1145\/2482767.2482789"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: SPAA, pp. 355\u2013364 (2010)","DOI":"10.1145\/1810479.1810540"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Kirsch, C.M., Payer, H., Sezgin, A., Sokolova, A.: Quantitative relaxation of concurrent data structures. In: POPL, pp. 317\u2013328 (2013)","DOI":"10.1145\/2480359.2429109"},{"key":"19_CR10","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann (2008)"},{"issue":"3","key":"19_CR11","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 TOPLAS\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM TOPLAS"},{"issue":"9","key":"19_CR12","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L. Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput.\u00a028(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"19_CR13","unstructured":"Sezgin, A.: Private correspondence (March 18, 2014)"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1897852.1897873","volume":"54","author":"N. Shavit","year":"2011","unstructured":"Shavit, N.: Data structures in the multicore age. Commun. ACM\u00a054(3), 76\u201384 (2011)","journal-title":"Commun. ACM"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Elimination trees and the construction of pools and stacks (preliminary version). In: SPAA, pp. 54\u201363 (1995)","DOI":"10.1145\/215399.215419"},{"issue":"6","key":"19_CR16","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s002240000072","volume":"30","author":"N. Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Elimination trees and the construction of pools and stacks. Theory Comput. Syst.\u00a030(6), 645\u2013670 (1997)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/235543.235546","volume":"14","author":"N. Shavit","year":"1996","unstructured":"Shavit, N., Zemach, A.: Diffracting trees. ACM Trans. Comput. Syst.\u00a014(4), 385\u2013428 (1996)","journal-title":"ACM Trans. Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:24:38Z","timestamp":1558909478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}