{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:44:21Z","timestamp":1742939061093,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031099922"},{"type":"electronic","value":"9783031099939"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09993-9_14","type":"book-chapter","created":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T20:12:42Z","timestamp":1656101562000},"page":"253-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds on\u00a0Message Passing Implementations of\u00a0Multiplicity-Relaxed Queues and\u00a0Stacks"],"prefix":"10.1007","author":[{"given":"Edward","family":"Talmage","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,25]]},"reference":[{"key":"14_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). https:\/\/doi.org\/10.1007\/978-3-642-17653-1_29"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P., Michael, M.M., Vechev, M.T.: Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26\u201328, 2011. pp. 487\u2013498. ACM (2011). https:\/\/doi.org\/10.1145\/1926385.1926442","DOI":"10.1145\/1926385.1926442"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Attiya, H., Welch, J.: Distributed Computing. Wiley (2004). https:\/\/doi.org\/10.1002\/0471478210.ch6","DOI":"10.1002\/0471478210.ch6"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: Relaxed queues and stacks from read\/write operations. In: Bramas, Q., Oshman, R., Romano, P. (eds.) 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14\u201316, 2020, Strasbourg, France (Virtual Conference). LIPIcs, vol. 184, pp. 13:1\u201313:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2020.13","DOI":"10.4230\/LIPIcs.OPODIS.2020.13"},{"key":"14_CR5","doi-asserted-by":"publisher","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 - January 23\u201325, 2013. pp. 317\u2013328. ACM (2013). https:\/\/doi.org\/10.1145\/2429069.2429109","DOI":"10.1145\/2429069.2429109"},{"key":"14_CR6","unstructured":"Kosa, M.J.: Time bounds for strong and hybrid consistency for arbitrary abstract data types. Chic. J. Theor. Comput. Sci. 1999 (1999). http:\/\/cjtcs.cs.uchicago.edu\/articles\/1999\/9\/contents.html"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Lundelius, J., Lynch, N.A.: A new fault-tolerant algorithm for clock synchronization. In: Kameda, T., Misra, J., Peters, J.G., Santoro, N. (eds.) Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 27\u201329, 1984. pp. 75\u201388. ACM (1984). https:\/\/doi.org\/10.1145\/800222.806738","DOI":"10.1145\/800222.806738"},{"issue":"2\/3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(84)80033-9","volume":"62","author":"J Lundelius","year":"1984","unstructured":"Lundelius, J., Lynch, N.A.: An upper and lower bound for clock synchronization. Inf. Control 62(2\/3), 190\u2013204 (1984)","journal-title":"Inf. Control"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Mavronicolas, M., Roth, D.: Linearizable read\/write objects. Theor. Comput. Sci. 220(1), 267\u2013319 (1999). https:\/\/doi.org\/10.1016\/S0304-3975(98)90244-4","DOI":"10.1016\/S0304-3975(98)90244-4"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Shavit, N., Taubenfeld, G.: The computability of relaxed data structures: queues and stacks as examples. Distributed Comput. 29(5), 395\u2013407 (2016). https:\/\/doi.org\/10.1007\/s00446-016-0272-0","DOI":"10.1007\/s00446-016-0272-0"},{"key":"14_CR11","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). https:\/\/doi.org\/10.1007\/978-3-662-45174-8_29"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Talmage, E., Welch, J.L.: Anomalies and similarities among consensus numbers of variously-relaxed queues. Computing 101(9), 1349\u20131368 (2019). https:\/\/doi.org\/10.1007\/s00607-018-0661-2","DOI":"10.1007\/s00607-018-0661-2"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Wang, J., Talmage, E., Lee, H., Welch, J.L.: Improved time bounds for linearizable implementations of abstract data types. Inf. Comput. 263, 1\u201330 (2018). https:\/\/doi.org\/10.1016\/j.ic.2018.08.004","DOI":"10.1016\/j.ic.2018.08.004"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09993-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T20:13:56Z","timestamp":1656101636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09993-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031099922","9783031099939"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09993-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2022.cs.uni-paderborn.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}