{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:06:26Z","timestamp":1749873986337,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["22\/1425"],"award-info":[{"award-number":["22\/1425"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ANR","award":["ANR-20-CE48-0006","ANR-23-CE48-0010","ANR-24-CE48-7768"],"award-info":[{"award-number":["ANR-20-CE48-0006","ANR-23-CE48-0010","ANR-24-CE48-7768"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733548","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"488-498","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Solvability Characterization for General Three-Process Tasks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8017-6457","authenticated-orcid":false,"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4534-4803","authenticated-orcid":false,"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Cit\u00e9 and CNRS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6629-8335","authenticated-orcid":false,"given":"Ami","family":"Paz","sequence":"additional","affiliation":[{"name":"LISN - CNRS & Paris Saclay University, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0009-5287","authenticated-orcid":false,"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[{"name":"Instituto de Matematicas, U.N.A.M., Mexico City, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"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\/20M1375851"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79158"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.JPDC.2023.02.002"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/983102"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90020-F"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2011.08.015"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167119"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008933"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/INCO.1993.1043"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1524-0703(03)00006-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796305766"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611477"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17653-1_17"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2022.73"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.IC.2020.104597"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Maurice Herlihy Dmitry N. Kozlov and Sergio Rajsbaum. 2013. Distributed Computing Through Combinatorial Topology. Morgan Kaufmann.","DOI":"10.1016\/B978-0-12-404578-1.00003-6"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 29th annual ACM symposium on Theory of computing. 589\u2013598","author":"Herlihy Maurice","year":"1997","unstructured":"Maurice Herlihy and Sergio Rajsbaum. 1997. The decidability of distributed decision tasks. In Proceedings of the 29th annual ACM symposium on Theory of computing. 589\u2013598."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00396-6"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.04.007"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331529"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236246.1236297"},{"key":"e_1_3_2_1_24_1","volume-title":"Elements of algebraic topology","author":"Munkres James R","unstructured":"James R Munkres. 1984. Elements of algebraic topology. Addison Wesley."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.OPODIS.2015.13"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_31"},{"key":"e_1_3_2_1_27_1","first-page":"3","article-title":"An algorithmic approach to the asynchronous computability theorem","volume":"1","author":"Saraph Vikram","year":"2018","unstructured":"Vikram Saraph, Maurice Herlihy, and Eli Gafni. 2018. An algorithmic approach to the asynchronous computability theorem. J. Appl. Comput. Topol. 1, 3\u20134 (2018), 451\u2013474.","journal-title":"J. Appl. Comput. Topol."},{"key":"e_1_3_2_1_28_1","volume-title":"Classical topology and combinatorial group theory. Graduate Texts in Mathematics","author":"Stillwell John C.","unstructured":"John C. Stillwell. 1980. Classical topology and combinatorial group theory. Graduate Texts in Mathematics, Vol. 72. Springer-Verlag, New York. xii+301 pages."}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:25:51Z","timestamp":1749824751000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":28,"alternative-id":["10.1145\/3732772.3733548","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733548","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}