{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:44:15Z","timestamp":1780994655874,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642399572","type":"print"},{"value":"9783642399589","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39958-9_18","type":"book-chapter","created":{"date-parts":[[2013,9,23]],"date-time":"2013-09-23T01:23:35Z","timestamp":1379899415000},"page":"208-223","source":"Crossref","is-referenced-by-count":28,"title":["Fast and Scalable, Lock-Free k-FIFO Queues"],"prefix":"10.1007","author":[{"given":"Christoph M.","family":"Kirsch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Lippautz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hannes","family":"Payer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Michael, M., Scott, M.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proc. Symposium on Principles of Distributed Computing, PODC, pp. 267\u2013275. ACM (1996)","DOI":"10.1145\/248052.248106"},{"key":"18_CR2","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":"18_CR3","doi-asserted-by":"crossref","unstructured":"Henzinger, T., Kirsch, C.M., Payer, H., Sezgin, A., Sokolova, A.: Quantitative relaxation of concurrent data structures. In: Proc. Symposium on Principles of Programming Languages, POPL. ACM (2013)","DOI":"10.1145\/2429069.2429109"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Kirsch, C.M., Lippautz, M., Payer, H.: Fast and scalable k-FIFO queues. Technical Report 2012-04, Department of Computer Sciences, University of Salzburg (June 2012)","DOI":"10.1007\/978-3-642-39958-9_18"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst (TOPLAS)\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: Proc. Symposium on Parallelism in Algorithms and Architectures, SPAA, pp. 355\u2013364. ACM (2010)","DOI":"10.1145\/1810479.1810540"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Colvin, R., Groves, L.: Formal verification of an array-based nonblocking queue. In: Proc. Conference on Engineering of Complex Computer Systems, ICECCS, pp. 507\u2013516. IEEE (2005)","DOI":"10.1109\/ICECCS.2005.49"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Sundell, H., Gidenstam, A., Papatriantafilou, M., Tsigas, P.: A lock-free algorithm for concurrent bags. In: Proc. Symposium on Parallelism in Algorithms and Architectures, SPAA, pp. 335\u2013344. ACM (2011)","DOI":"10.1145\/1989493.1989550"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-15291-7_16","volume-title":"Euro-Par 2010 - Parallel Processing","author":"Y. Afek","year":"2010","unstructured":"Afek, Y., Korland, G., Natanzon, M., Shavit, N.: Scalable producer-consumer pools based on elimination-diffraction trees. In: D\u2019Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010, Part II. LNCS, vol.\u00a06272, pp. 151\u2013162. Springer, Heidelberg (2010)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-24100-0_2","volume-title":"Distributed Computing","author":"Y. Afek","year":"2011","unstructured":"Afek, Y., Hakimi, M., Morrison, A.: Fast and scalable rendezvousing. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 16\u201331. Springer, Heidelberg (2011)"},{"issue":"6","key":"18_CR11","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"M. Michael","year":"2004","unstructured":"Michael, M.: Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst.\u00a015(6), 491\u2013504 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1111\/j.1749-6632.1980.tb29690.x","volume":"357","author":"B. Mandelbrot","year":"1980","unstructured":"Mandelbrot, B.: Fractal aspects of the iteration of z\u2009\u2192\u2009\u03bbz(1\u2009\u2212\u2009z) for complex \u03bb and z. Annals of the New York Academy of Sciences\u00a0357, 249\u2013259 (1980)","journal-title":"Annals of the New York Academy of Sciences"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1016\/j.jpdc.2005.03.011","volume":"65","author":"D. Bader","year":"2005","unstructured":"Bader, D., Cong, G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). Journal of Parallel and Distributed Computing\u00a065, 994\u20131006 (2005)","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39958-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T19:00:05Z","timestamp":1688497205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39958-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642399572","9783642399589"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39958-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}