{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:25:10Z","timestamp":1740108310491,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2018,9,22]],"date-time":"2018-09-22T00:00:00Z","timestamp":1537574400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,9,22]],"date-time":"2018-09-22T00:00:00Z","timestamp":1537574400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1526725"],"award-info":[{"award-number":["1526725"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00607-018-0661-2","type":"journal-article","created":{"date-parts":[[2018,9,22]],"date-time":"2018-09-22T07:12:20Z","timestamp":1537600340000},"page":"1349-1368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Anomalies and similarities among consensus numbers of variously-relaxed queues"],"prefix":"10.1007","volume":"101","author":[{"given":"Edward","family":"Talmage","sequence":"first","affiliation":[]},{"given":"Jennifer L.","family":"Welch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,22]]},"reference":[{"key":"661_CR1","doi-asserted-by":"crossref","unstructured":"Afek Y, Korland G, Yanovsky E (2010) Quasi-linearizability: Relaxed consistency for improved concurrency. In: Lu C, Masuzawa T, Mosbah M (eds) Principles of Distributed Systems\u2013 14th International Conference, OPODIS 2010, Tozeur, Tunisia, December 14\u201317, 2010. Proceedings, volume 6490 of Lecture Notes in Computer Science, pp 395\u2013410. Springer","DOI":"10.1007\/978-3-642-17653-1_29"},{"key":"661_CR2","unstructured":"Anderson JH, Gouda MG (1990) The virtue of patience: concurrent programming with and without waiting. Technical report"},{"issue":"2","key":"661_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/176575.176576","volume":"12","author":"H Attiya","year":"1994","unstructured":"Attiya H, Welch JL (1994) Sequential consistency versus linearizability. ACM Trans Comput Syst 12(2):91\u2013122","journal-title":"ACM Trans Comput Syst"},{"key":"661_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2013.05.036","volume":"503","author":"W Chen","year":"2013","unstructured":"Chen W, Hu G, Zhang J (2013) On the power of breakable objects. Theor Comput Sci 503:89\u2013108","journal-title":"Theor Comput Sci"},{"key":"#cr-split#-661_CR5.1","doi-asserted-by":"crossref","unstructured":"Chor B, Israeli A, Li M (1987) On processor coordination using asynchronous hardware. In: Schneider Fred B,","DOI":"10.1145\/41840.41848"},{"key":"#cr-split#-661_CR5.2","unstructured":"(ed) Proceedings of the sixth annual ACM symposium on principles of distributed computing, Vancouver, British Columbia, Canada, August 10-12, 1987, pp 86-97. ACM"},{"issue":"2","key":"661_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer MJ, Lynch NA, Paterson M (1985) Impossibility of distributed consensus with one faulty process. J ACM 32(2):374\u2013382","journal-title":"J ACM"},{"key":"661_CR7","doi-asserted-by":"crossref","unstructured":"Henzinger TA, Kirsch CM, Payer H, Sezgin A, Sokolova A (2013) 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 \u201913, Rome, Italy, January 23\u201325, 2013, pp 317\u2013328. ACM","DOI":"10.1145\/2429069.2429109"},{"issue":"1","key":"661_CR8","doi-asserted-by":"publisher","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"},{"key":"661_CR9","doi-asserted-by":"publisher","unstructured":"Kosa MJ (1999) Time bounds for strong and hybrid consistency for arbitrary abstract data types. Chicago J Theor Comput Sci 1999. \n                    https:\/\/doi.org\/10.4086\/cjtcs.1999.009","DOI":"10.4086\/cjtcs.1999.009"},{"key":"661_CR10","unstructured":"Lipton RJ, Sandberg JS (1988) PRAM: A scalable shared memory. Technical Report CS-TR-180-88, Princeton University, Department of Computer Science"},{"issue":"3","key":"661_CR11","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1137\/S0097539798335766","volume":"30","author":"W-K Lo","year":"2000","unstructured":"Lo W-K, Hadzilacos V (2000) All of us are smarter than any of us: nondeterministic wait-free hierarchies are not robust. SIAM J Comput 30(3):689\u2013728","journal-title":"SIAM J Comput"},{"issue":"163\u2013183","key":"661_CR12","first-page":"31","volume":"4","author":"MC Loui","year":"1987","unstructured":"Loui MC, Abu-Amara HH (1987) Memory requirements for agreement among unreliable asynchronous processes. Adv Comput Res 4(163\u2013183):31","journal-title":"Adv Comput Res"},{"key":"661_CR13","unstructured":"Lynch Nancy A (1996) Morgan Kaufmann, Distributed Algorithms"},{"key":"#cr-split#-661_CR14.1","doi-asserted-by":"crossref","unstructured":"Shavit N, Taubenfeld G (2015) The computability of relaxed data structures: queues and stacks as examples. In: Scheideler C","DOI":"10.1007\/978-3-319-25258-2_29"},{"key":"#cr-split#-661_CR14.2","unstructured":"(ed) Structural information and communication complexity-22nd international colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings, volume 9439 of Lecture Notes in Computer Science, pages 414-428. Springer"},{"issue":"5","key":"661_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00446-016-0272-0","volume":"29","author":"N Shavit","year":"2016","unstructured":"Shavit N, Taubenfeld G (2016) The computability of relaxed data structures: queues and stacks as examples. Distrib Comput 29(5):395\u2013407","journal-title":"Distrib Comput"},{"key":"#cr-split#-661_CR16.1","doi-asserted-by":"crossref","unstructured":"Talmage E, Welch JL (2014) Improving average performance by relaxing distributed data structures. In: Kuhn F","DOI":"10.1007\/978-3-662-45174-8_29"},{"key":"#cr-split#-661_CR16.2","unstructured":"(ed) Distributed computing-28th international symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings, volume 8784 of Lecture notes in computer science, pp 421-438. Springer"},{"key":"661_CR17","unstructured":"Talmage E, Welch JL (2015) Generic proofs of consensus numbers for abstract data types. In: Anceaume E, Cachin C, Potop-Butucaru MG (eds) 19th international conference on principles of distributed systems, OPODIS 2015, December 14\u201317, 2015, Rennes, France, vol\u201346 of LIPIcs, pp 32:1\u201332:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik"},{"key":"661_CR18","unstructured":"Talmage E, Welch JL (2017) Anomalies and similarities among consensus numbers of relaxed queues. In: Abbadi Amr El, Garbinato B (eds), 5th Edn of the international conference on networked systems, NETYS 2017, May 17\u201319, 2017, Marrakech, Morocco, vol 10299 of Lecture notes in computer science. Springer"},{"key":"661_CR19","doi-asserted-by":"crossref","unstructured":"Wang J, Talmage E, Lee H, Welch JL (2014) Improved time bounds for linearizable implementations of abstract data types. In: 2014 IEEE 28th international parallel and distributed processing symposium, Phoenix, AZ, USA, May 19-23, 2014, pp 691\u2013701. IEEE Computer Society","DOI":"10.1109\/IPDPS.2014.77"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0661-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-018-0661-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0661-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:04:11Z","timestamp":1589443451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-018-0661-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,22]]},"references-count":22,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["661"],"URL":"https:\/\/doi.org\/10.1007\/s00607-018-0661-2","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2018,9,22]]},"assertion":[{"value":"30 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}