{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:49Z","timestamp":1760202709192},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596464"},{"type":"electronic","value":"9783319596471"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59647-1_15","type":"book-chapter","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T22:53:30Z","timestamp":1494629610000},"page":"191-205","source":"Crossref","is-referenced-by-count":1,"title":["Anomalies and Similarities Among Consensus Numbers of Variously-Relaxed Queues"],"prefix":"10.1007","author":[{"given":"Edward","family":"Talmage","sequence":"first","affiliation":[]},{"given":"Jennifer L.","family":"Welch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"key":"15_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. 6490, pp. 395\u2013410. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-17653-1_29"},{"issue":"2","key":"15_CR2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/176575.176576","volume":"12","author":"H Attiya","year":"1994","unstructured":"Attiya, H., Welch, J.L.: Sequential consistency versus linearizability. ACM Trans. Comput. Syst. 12(2), 91\u2013122 (1994)","journal-title":"ACM Trans. Comput. Syst."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.tcs.2013.05.036","volume":"503","author":"W Chen","year":"2013","unstructured":"Chen, W., Guangda, H., Zhang, J.: On the power of breakable objects. Theor. Comput. Sci. 503, 89\u2013108 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR4","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Kirsch, C.M., Payer, H., Sezgin, A., Sokolova, A.: Quantitative relaxation of concurrent data structures. In: Giacobazzi, R., Cousot, R. (eds.) The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, Rome, Italy, 23\u201325 January 2013, pp. 317\u2013328. ACM (2013)","key":"15_CR5","DOI":"10.1145\/2429069.2429109"},{"issue":"1","key":"15_CR6","doi-asserted-by":"crossref","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. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"doi-asserted-by":"crossref","unstructured":"Kosa, M.J.: Time bounds for strong and hybrid consistency for arbitrary abstract data types. Chicago J. Theor. Comput. Sci. (1999)","key":"15_CR7","DOI":"10.4086\/cjtcs.1999.009"},{"unstructured":"Lipton, R.J., Sandberg, J.S.: PRAM: a scalable shared memory. Technical report CS-TR-180-88, Princeton University, Department of Computer Science, September 1988","key":"15_CR8"},{"issue":"3","key":"15_CR9","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1137\/S0097539798335766","volume":"30","author":"W-K Lo","year":"2000","unstructured":"Lo, W.-K., Hadzilacos, V.: All of us are smarter than any of us: nondeterministic wait-free hierarchies are not robust. SIAM J. Comput. 30(3), 689\u2013728 (2000)","journal-title":"SIAM J. Comput."},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-25258-2_29","volume-title":"Structural Information and Communication Complexity","author":"N Shavit","year":"2015","unstructured":"Shavit, N., Taubenfeld, G.: The computability of relaxed data structures: queues and stacks as examples. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 414\u2013428. Springer, Cham (2015). doi:\n10.1007\/978-3-319-25258-2_29"},{"issue":"5","key":"15_CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s00446-016-0272-0","volume":"29","author":"N Shavit","year":"2016","unstructured":"Shavit, N., Taubenfeld, G.: The computability of relaxed data structures: queues and stacks as examples. Distrib. Comput. 29(5), 395\u2013407 (2016)","journal-title":"Distrib. Comput."},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-662-45174-8_29","volume-title":"Distributed Computing","author":"E Talmage","year":"2014","unstructured":"Talmage, E., Welch, J.L.: Improving average performance by relaxing distributed data structures. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 421\u2013438. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-45174-8_29"},{"unstructured":"Talmage, E., Welch, J.L.: Generic proofs of consensus numbers for abstract data types. In: Anceaume, E., Cachin, C., Potop-Butucaru, M.G. (eds.) 19th International Conference on Principles of Distributed Systems, OPODIS 2015, 14\u201317 December 2015, Rennes, France. LIPIcs, vol. 46, pp. 32:1\u201332:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)","key":"15_CR13"},{"doi-asserted-by":"crossref","unstructured":"Wang, J., Talmage, E., Lee, H., Welch, J.L.: Improved time bounds for linearizable implementations of abstract data types. In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium, Phoenix, AZ, USA, 19\u201323 May 2014, pp. 691\u2013701. IEEE Computer Society (2014)","key":"15_CR14","DOI":"10.1109\/IPDPS.2014.77"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59647-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T22:58:15Z","timestamp":1494629895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59647-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596464","9783319596471"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59647-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}