{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:40Z","timestamp":1750221280631,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T00:00:00Z","timestamp":1515024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["16-CE40-0023-03"],"award-info":[{"award-number":["16-CE40-0023-03"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["14-CE35-0010-02"],"award-info":[{"award-number":["14-CE35-0010-02"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,1,4]]},"DOI":"10.1145\/3154273.3154296","type":"proceedings-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T13:49:57Z","timestamp":1515764997000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Set-Constrained Delivery Broadcast"],"prefix":"10.1145","author":[{"given":"Damien","family":"Imbs","sequence":"first","affiliation":[{"name":"LIF, Universit\u00e9 Aix-Marseille, Marseille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Achour","family":"Most\u00e9faoui","sequence":"additional","affiliation":[{"name":"LS2N, Universit\u00e9 de Nantes, Nantes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthieu","family":"Perrin","sequence":"additional","affiliation":[{"name":"LS2N, Universit\u00e9 de Nantes, Nantes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[{"name":"Institut Universitaire de France, IRISA, Universit\u00e9 de Rennes, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/153724.153741"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01784241"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02280833"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/97444.97701"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200869"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242714"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795279463"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/176575.176576"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed computing: fundamentals, simulations and advanced topics, (2d Edition)","author":"Attiya H.","year":"2004","unstructured":"Attiya H. and Welch J.L. , Distributed computing: fundamentals, simulations and advanced topics, (2d Edition) , Wiley-Interscience , 414 pages ( 2004 ) Attiya H. and Welch J.L., Distributed computing: fundamentals, simulations and advanced topics, (2d Edition), Wiley-Interscience, 414 pages (2004)"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/62546.62590"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/7351.7478"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1043"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49583-5_26"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30577-4_3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332458"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-003-0096-6"},{"key":"e_1_3_2_1_19_1","volume-title":"The Art of Multiprocessor Programming. Morgan Kaufmann Pub., 508","author":"Herlihy M.P.","year":"2008","unstructured":"Herlihy M.P. and Shavit N. , The Art of Multiprocessor Programming. Morgan Kaufmann Pub., 508 pages ( 2008 ) Herlihy M.P. and Shavit N., The Art of Multiprocessor Programming. Morgan Kaufmann Pub., 508 pages (2008)"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"volume-title":"Abstraction Power, and Computability Limits. {Research Report} LIF, Universit\u00c3l Aix-Marseille","author":"Imbs D.","key":"e_1_3_2_1_21_1","unstructured":"Imbs D. , Most\u00e9faoui A. , Perrin M. , and Raynal M. , Set-Constrained Delivery Broadcast: Definition , Abstraction Power, and Computability Limits. {Research Report} LIF, Universit\u00c3l Aix-Marseille ; LINA-University of Nantes; IMDEA Software Institute ; Institut Universitaire de France; IRISA, Universit\u00c3l de Rennes., 2017. hal-01540010 Imbs D., Most\u00e9faoui A., Perrin M., and Raynal M., Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. {Research Report} LIF, Universit\u00c3l Aix-Marseille; LINA-University of Nantes; IMDEA Software Institute; Institut Universitaire de France; IRISA, Universit\u00c3l de Rennes., 2017. hal-01540010"},{"volume-title":"Proc. 31th Int'l Symposium on Distributed Computing (DISC'17)","author":"Imbs D.","key":"e_1_3_2_1_22_1","unstructured":"Imbs D. , Most\u00e9faoui A. , Perrin M. , and Raynal M ., Which broadcast abstraction captures k -set agreement? Proc. 31th Int'l Symposium on Distributed Computing (DISC'17) , to appear in LIPICs (2017) Imbs D., Most\u00e9faoui A., Perrin M., and Raynal M., Which broadcast abstraction captures k -set agreement? Proc. 31th Int'l Symposium on Distributed Computing (DISC'17), to appear in LIPICs (2017)"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.08.005"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/645951.675482"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060697"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675439"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01786227"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90052-4"},{"key":"e_1_3_2_1_29_1","volume-title":"Communication and agreement abstractions for fault-tolerant asynchronous distributed systems. Morgan & Claypool, 251","author":"Raynal M.","year":"2010","unstructured":"Raynal M. , Communication and agreement abstractions for fault-tolerant asynchronous distributed systems. Morgan & Claypool, 251 pages ( 2010 ) Raynal M., Communication and agreement abstractions for fault-tolerant asynchronous distributed systems. Morgan & Claypool, 251 pages (2010)"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-32027-9","volume-title":"Concurrent programming: algorithms, principles and foundations","author":"Raynal M.","year":"2013","unstructured":"Raynal M. , Concurrent programming: algorithms, principles and foundations . Springer , 515 pages ( 2013 ) Raynal M., Concurrent programming: algorithms, principles and foundations. Springer, 515 pages (2013)"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1007\/978-1-4939-2864-4_367","volume-title":"Set agreement. Encyclopedia of Algorithms","author":"Raynal M.","year":"2016","unstructured":"Raynal M. , Set agreement. Encyclopedia of Algorithms , Springer , pp. 1956 -- 1959 ( 2016 ) Raynal M., Set agreement. Encyclopedia of Algorithms, Springer, pp. 1956--1959 (2016)"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90008-6"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2050613.2050642"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050028"}],"event":{"name":"ICDCN '18: 19th International Conference on Distributed Computing and Networking","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Varanasi India","acronym":"ICDCN '18"},"container-title":["Proceedings of the 19th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3154273.3154296","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3154273.3154296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:20Z","timestamp":1750212680000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3154273.3154296"}},"subtitle":["Definition, Abstraction Power, and Computability Limits"],"short-title":[],"issued":{"date-parts":[[2018,1,4]]},"references-count":34,"alternative-id":["10.1145\/3154273.3154296","10.1145\/3154273"],"URL":"https:\/\/doi.org\/10.1145\/3154273.3154296","relation":{},"subject":[],"published":{"date-parts":[[2018,1,4]]},"assertion":[{"value":"2018-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}