{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:53Z","timestamp":1740109253780,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T00:00:00Z","timestamp":1582329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T00:00:00Z","timestamp":1582329600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["SARC #27648"],"award-info":[{"award-number":["SARC #27648"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Committee of the University of Ioannina","award":["#80022"],"award-info":[{"award-number":["#80022"]}]},{"name":"ARISTEIA Action of the Operational Program Education and Lifelong Learning","award":["GreenVM #1643"],"award-info":[{"award-number":["GreenVM #1643"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s00446-020-00370-7","type":"journal-article","created":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T12:02:43Z","timestamp":1582372963000},"page":"485-513","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The RedBlue family of universal constructions"],"prefix":"10.1007","volume":"33","author":[{"given":"Panagiota","family":"Fatourou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos D.","family":"Kallimanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,22]]},"reference":[{"unstructured":"Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-lived renaming made adaptive. In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pp. 91\u2013103 (1990)","key":"370_CR1"},{"doi-asserted-by":"crossref","unstructured":"Afek, Y., Boxer, P., Touitou, D.: Bounds on the shared memory requirements for long-lived and adaptive objects. In Proceedings of the 19th ACM Symposium on Principles of Distributed Computing, pp. 81\u201389 (2000)","key":"370_CR2","DOI":"10.1145\/343477.343523"},{"doi-asserted-by":"crossref","unstructured":"Afek, Y., Dauber, D., Touitou, D.: Wait-free made fast. In: Proceedings of the 27th ACM Symposium on Theory of Computing, pp. 538\u2013547 (1995)","key":"370_CR3","DOI":"10.1145\/225058.225271"},{"issue":"12","key":"370_CR4","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1109\/71.819952","volume":"10","author":"JH Anderson","year":"1999","unstructured":"Anderson, J.H., Moir, M.: Universal constructions for large objects. IEEE Trans. Parallel Distrib. Syst. 10(12), 1317\u20131332 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"370_CR5","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1137\/S0097539700366000","volume":"31","author":"H Attiya","year":"2001","unstructured":"Attiya, H., Fouren, A.: Adaptive and efficient wait-free algorithms for lattice agreement and renaming. SIAM J. Comput. 31(2), 642\u2013664 (2001)","journal-title":"SIAM J. Comput."},{"key":"370_CR6","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/792538.792541","volume":"50","author":"H Attiya","year":"2003","unstructured":"Attiya, H., Fouren, A.: Algorithms adapting to point contention. J. ACM 50, 444\u2013468 (2003)","journal-title":"J. ACM"},{"key":"370_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. Wiley, New York (2004)"},{"doi-asserted-by":"crossref","unstructured":"Barnes, G.: A method for implementing lock-free shared data structures. In: Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures, pp. 261\u2013270 (1993)","key":"370_CR8","DOI":"10.1145\/165231.165265"},{"doi-asserted-by":"crossref","unstructured":"Chandra, T.D., Jayanti, P., Tan, K.: A polylog time wait-free construction for closed objects. In: Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, pp. 287\u2013296 (1998)","key":"370_CR9","DOI":"10.1145\/277697.277753"},{"doi-asserted-by":"crossref","unstructured":"Chuong, P., Ellen, F., Ramachandran, V.: A universal construction for wait-free transaction friendly data structures. In: Proceedings of the 22nd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 335\u2013344 (2010)","key":"370_CR10","DOI":"10.1145\/1810479.1810538"},{"doi-asserted-by":"crossref","unstructured":"Fatourou, P., Kallimanis, N.D.: The redblue adaptive universal constructions. Technical Report TR 2009-02, Department of Computer Science, University of Ioannina (2009, February)","key":"370_CR11","DOI":"10.1007\/978-3-642-04355-0_15"},{"doi-asserted-by":"crossref","unstructured":"Fatourou, P., Kallimanis, N.D.: The redblue adaptive universal constructions. In: Proceedings of the 23rd International Symposium Distributed Computing, volume 5805 of Lecture Notes in Computer Science, pp. 127\u2013141. Springer (2009)","key":"370_CR12","DOI":"10.1007\/978-3-642-04355-0_15"},{"doi-asserted-by":"crossref","unstructured":"Fatourou, P., Kallimanis, N.D.: A highly-efficient wait-free universal construction. In Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 325\u2013334. ACM (2011)","key":"370_CR13","DOI":"10.1145\/1989493.1989549"},{"issue":"3","key":"370_CR14","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00224-013-9491-y","volume":"55","author":"P Fatourou","year":"2014","unstructured":"Fatourou, P., Kallimanis, N.D.: Highly-efficient wait-free synchronization. Theory Comput. Syst. 55(3), 475\u2013520 (2014)","journal-title":"Theory Comput. Syst."},{"key":"370_CR15","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Progr. Lang. Syst. 13, 124\u2013149 (1991)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"issue":"5","key":"370_CR16","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/161468.161469","volume":"15","author":"M Herlihy","year":"1993","unstructured":"Herlihy, M.: A methodology for implementing highly concurrent data objects. ACM Trans. Progr. Lang. Syst. 15(5), 745\u2013770 (1993)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"370_CR17","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/S1571-0661(04)81017-X","volume":"78","author":"M Herlihy","year":"2003","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Space and time adaptive non-blocking algorithms. Electron. Notes Theor. Comput. Sci. 78, 260 (2003)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. In: Proceedings of the 20th Annual International Symposium on Computer Architecture, pp. 289\u2013300. ACM (1993)","key":"370_CR18","DOI":"10.1145\/173682.165164"},{"key":"370_CR19","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Progr. Lang. Syst. 12, 463\u2013492 (1990)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"doi-asserted-by":"crossref","unstructured":"Jayanti, P.: A time complexity lower bound for randomized implementations of some shared objects. In: Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, pp. 201\u2013210 (1998)","key":"370_CR20","DOI":"10.1145\/277697.277735"},{"doi-asserted-by":"crossref","unstructured":"Jayanti, P.: f-arrays: implementation and applications. In: Proceedings of the 21th ACM Symposium on Principles of Distributed Computing, pp. 270\u2013279 (2002)","key":"370_CR21","DOI":"10.1145\/571825.571875"},{"unstructured":"Jayanti, P., Petrovic, S.: Efficient wait-free implementation of multiword LL\/SC variables. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, pp. 59\u201368 (2005)","key":"370_CR22"},{"doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: Proceedings of the 14th annual ACM Symposium on Principles of Distributed Computing, pp. 204\u2013213. ACM (1995)","key":"370_CR23","DOI":"10.1145\/224964.224987"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-020-00370-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-020-00370-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-020-00370-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,21]],"date-time":"2021-02-21T01:02:48Z","timestamp":1613869368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-020-00370-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,22]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["370"],"URL":"https:\/\/doi.org\/10.1007\/s00446-020-00370-7","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2020,2,22]]},"assertion":[{"value":"9 January 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}