{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:41Z","timestamp":1750221281538,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"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\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1655166"],"award-info":[{"award-number":["1655166"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-16-CE40-0023"],"award-info":[{"award-number":["ANR-16-CE40-0023"]}],"id":[{"id":"10.13039\/501100001665","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.3154303","type":"proceedings-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T13:49:57Z","timestamp":1515764997000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Assignment Problem"],"prefix":"10.1145","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Diderot, Paris, France"}]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Diderot, Paris, France"}]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, California, USA"}]},{"given":"Giuliano","family":"Losa","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, California, USA"}]}],"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.1137\/12088478X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0969"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79158"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/164051.164056"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/72981.72991"},{"volume-title":"Structural Information and Communication Complexity (Lecture Notes in Computer Science)","author":"Casta\u00f1eda Armando","key":"e_1_3_2_1_8_1","unstructured":"Armando Casta\u00f1eda , Pierre Fraigniaud , Eli Gafni , Sergio Rajsbaum , and Matthieu Roy . 2016. Asynchronous Coordination Under Preferences and Constraints . In Structural Information and Communication Complexity (Lecture Notes in Computer Science) , Vol. 9988 . Springer , Cham , 111--126. Armando Casta\u00f1eda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, and Matthieu Roy. 2016. Asynchronous Coordination Under Preferences and Constraints. In Structural Information and Communication Complexity (Lecture Notes in Computer Science), Vol. 9988. Springer, Cham, 111--126."},{"key":"e_1_3_2_1_9_1","volume-title":"Two starvation free solutions of a general exclusion problem","author":"Dijkstra E. W.","year":"1978","unstructured":"E. W. Dijkstra . 1977. Two starvation free solutions of a general exclusion problem , 1978 . EWD. E. W. Dijkstra. 1977. Two starvation free solutions of a general exclusion problem, 1978. EWD."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255527"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/59287.59292"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1308172.1308225"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/3271116.3271170"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_27"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25959-3_9"},{"key":"e_1_3_2_1_16_1","volume-title":"Schwarzmann","author":"Kentros Sotirios","year":"2009","unstructured":"Sotirios Kentros , Aggelos Kiayias , Nicolas Nicolaou , and Alexander A . Schwarzmann . 2009 . At-most-once semantics in asynchronous shared memory. In International Symposium on Distributed Computing. Springer , 258--273. Sotirios Kentros, Aggelos Kiayias, Nicolas Nicolaou, and Alexander A. Schwarzmann. 2009. At-most-once semantics in asynchronous shared memory. In International Symposium on Distributed Computing. Springer, 258--273."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/361082.361093"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01786227"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03466-4_2"},{"key":"e_1_3_2_1_20_1","volume-title":"Abu-Amara","author":"Loui Michael C.","year":"1987","unstructured":"Michael C. Loui and Hosame H . Abu-Amara . 1987 . Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing research 4, 163--183 (1987), 31. Michael C. Loui and Hosame H. Abu-Amara. 1987. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing research 4, 163--183 (1987), 31."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(95)00009-H"},{"key":"e_1_3_2_1_22_1","volume-title":"Garay","author":"Moir Mark","year":"1996","unstructured":"Mark Moir and Juan A . Garay . 1996 . Fast, long-lived renaming improved and simplified. In Distributed Algorithms (Lecture Notes in Computer Science). Springer , Berlin, Heidelberg, 287--303. Mark Moir and Juan A. Garay. 1996. Fast, long-lived renaming improved and simplified. In Distributed Algorithms (Lecture Notes in Computer Science). Springer, Berlin, Heidelberg, 287--303."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90106-X"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646704.702012"}],"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.3154303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3154273.3154303","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3154273.3154303","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.3154303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,4]]},"references-count":24,"alternative-id":["10.1145\/3154273.3154303","10.1145\/3154273"],"URL":"https:\/\/doi.org\/10.1145\/3154273.3154303","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"}}]}}